Intrinsic robustness of the price of anarchy
From MaRDI portal
Publication:3177741
DOI10.1145/2806883zbMATH Open1427.91015OpenAlexW2294025081MaRDI QIDQ3177741FDOQ3177741
Authors: Tim Roughgarden 
Publication date: 2 August 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.3430
Recommendations
- Intrinsic robustness of the price of anarchy
- Local smoothness and the price of anarchy in atomic splittable congestion games
- On the robustness of the approximate price of anarchy in generalized congestion games
- Local smoothness and the price of anarchy in splittable congestion games
- Algorithms – ESA 2005
Cited In (53)
- The impact of worst-case deviations in non-atomic network routing games
- The price of anarchy for utilitarian scheduling games on related machines
- A library for algorithmic game theory in \textsf{Ssreflect/Coq}
- On the impact of singleton strategies in congestion games
- Tight welfare guarantees for pure Nash equilibria of the uniform price auction
- Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models
- Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
- A convergence analysis of the price of anarchy in atomic congestion games
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- Location Games on Networks: Existence and Efficiency of Equilibria
- Small-Loss Bounds for Online Learning with Partial Information
- Dynamic inefficiency: anarchy without stability
- Intrinsic robustness of the price of anarchy
- Tight inefficiency bounds for perception-parameterized affine congestion games
- An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions
- Limited-trust equilibria
- Principal-agent VCG contracts
- The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users
- Bounding the inefficiency of Nash equilibria in games with finitely many players
- Robust price of anarchy bounds via LP and Fenchel duality
- Game efficiency through linear programming duality
- Bayesian generalized network design
- Pathwise smooth splittable congestion games and inefficiency
- Routing MEV in constant function market makers
- Nonatomic non-cooperative neighbourhood balancing games
- Convergence of incentive-driven dynamics in Fisher markets
- Best-response dynamics in combinatorial auctions with item bidding
- Selfishness need not be bad
- Price of anarchy for parallel link networks with generalized mean objective
- The price of anarchy in large games
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- Delegation and ambiguity in correlated equilibrium
- Congestion games with priority-based scheduling
- On the robustness of the approximate price of anarchy in generalized congestion games
- Exploration-exploitation in multi-agent learning: catastrophe theory meets game theory
- Local and global price of anarchy of graphical games
- The Price of Stochastic Anarchy
- On the Price of Anarchy of cost-sharing in real-time scheduling systems
- Congestion games with complementarities
- Algorithms as mechanisms: the price of anarchy of relax and round
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness
- The price of stability of weighted congestion games
- The price of stability of weighted congestion games
- Title not available (Why is that?)
- Local smoothness and the price of anarchy in atomic splittable congestion games
- Reception capacity: definitions, game theory and hardness
- Competitive algorithms for demand response management in a smart grid
- The price of anarchy of affine congestion games with similar strategies
- Bayesian generalized network design
- Smart routing of electric vehicles for load balancing in smart grids
- Computing approximate equilibria in weighted congestion games via best-responses
- Bounding quality of pure Nash equilibria in dual-role facility location games
- Non-atomic one-round walks in congestion games
This page was built for publication: Intrinsic robustness of the price of anarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177741)
