50 results on '"GAIRING, MARTIN"'
Search Results
2. A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback
3. Cost-Sharing in Generalised Selfish Routing
4. Tight Bounds for Cost-Sharing in Weighted Congestion Games
5. Approximate Pure Nash Equilibria in Social Context Congestion Games
6. Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria
7. Congestion Games with Player-Specific Costs Revisited
8. Price of Stability in Polynomial Congestion Games
9. Computing Stable Outcomes in Hedonic Games
10. Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
11. Covering Games: Approximation through Non-cooperation
12. Malicious Bayesian Congestion Games
13. Total Latency in Singleton Congestion Games
14. Price of Anarchy for Polynomial Wardrop Games
15. Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
16. Exact Price of Anarchy for Polynomial Congestion Games
17. A Simple Graph-Theoretic Model for Selfish Restricted Scheduling
18. A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines
19. Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture
20. The Price of Anarchy for Polynomial Social Cost
21. Nash Equilibria in Discrete Routing Games with Convex Latency Functions
22. Extreme Nash Equilibria
23. Nashification and the Coordination Ratio for a Selfish Routing Game
24. Self-Stabilizing Algorithms for {k}-Domination
25. Designing Cost-Sharing Methods for Bayesian Games
26. An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling
27. The Anarchy of Scheduling Without Money
28. Bribeproof Mechanisms for Two-Values Domains
29. Revenue Maximization for Market Intermediation with Correlated Priors
30. The Price of Stability of Simple Symmetric Fractional Hedonic Games
31. Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets
32. Truthfulness and Approximation with Value-Maximizing Bidders
33. SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism
34. The Stable Roommates Problem with Short Lists
35. Stable Matching with Uncertain Linear Preferences
36. Strong and Weak Acyclicity in Iterative Voting
37. Analyzing Power in Weighted Voting Games with Super-Increasing Weights
38. Efficiency of Equilibria in Uniform Matroid Congestion Games
39. On Selfish Creation of Robust Networks
40. Dynamic Resource Allocation Games
41. On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games
42. History-Independent Distributed Multi-agent Learning
43. The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games
44. On the Price of Anarchy of Highly Congested Nonatomic Network Games
45. The Big Match in Small Space : (Extended Abstract)
46. Deciding Maxmin Reachability in Half-Blind Stochastic Games
47. Lipschitz Continuity and Approximate Equilibria
48. Complexity and Optimality of the Best Response Algorithm in Random Potential Games
49. The Parallel Complexity of Coloring Games
50. Logarithmic Query Complexity for Approximate Nash Computation in Large Games
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.