The price of anarchy in large games
From MaRDI portal
Publication:5361894
DOI10.1145/2897518.2897580zbMath1377.91013arXiv1503.04755OpenAlexW1620026671MaRDI QIDQ5361894
Tim Roughgarden, Michal Feldman, Vasilis Syrgkanis, Nicole Immorlica, Brendan Lucier
Publication date: 29 September 2017
Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.04755
Analysis of algorithms (68W40) Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (14)
Robust perfect equilibrium in large games ⋮ Interconnected pay-as-bid auctions ⋮ Strength in numbers: robust mechanisms for public goods with many agents ⋮ On network formation games with heterogeneous players and basic network creation games ⋮ When is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic ⋮ Price of anarchy for highly congested routing games in parallel networks ⋮ Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games ⋮ On the efficiency of all-pay mechanisms ⋮ On the price of anarchy of two-stage machine scheduling games ⋮ On the Price of Anarchy of Highly Congested Nonatomic Network Games ⋮ Game efficiency through linear programming duality ⋮ On Network Formation Games with Heterogeneous Players and Basic Network Creation Games ⋮ Chaotic triopoly game: a congestion case
This page was built for publication: The price of anarchy in large games
