Name
Abstract | ||
|---|---|---|
We present an analysis framework for bounding the price of anarchy (POA) in games that have many players, as in many of the games most pertinent to computer science applications. We use this framework to demonstrate that, in many of the models in which the POA has been studied, the POA in large games is much smaller than the worst-case bound. Our framework also differentiates between mechanisms with similar worst-case performance, such as simultaneous uniform-price auctions and greedy combinatorial auctions, thereby providing new insights about which mechanisms are likely to perform well in realistic settings. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2897518.2897580 | STOC |
Keywords | Field | DocType |
Price of Anarchy,Large games,Smoothness,Combinatorial auctions | Mathematical economics,Price of stability,Combinatorial auction,Computer science,Common value auction,Price of anarchy,Smoothness,Bounding overwatch | Journal |
Volume | ISSN | Citations |
abs/1503.04755 | 0737-8017 | 2 |
PageRank | References | Authors |
0.38 | 9 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michal Feldman | 1 | 1095 | 93.13 |
| Nicole Immorlica | 2 | 1207 | 93.59 |
| Brendan Lucier | 3 | 638 | 52.17 |
| Tim Roughgarden | 4 | 4177 | 353.32 |
| Vasilis Syrgkanis | 5 | 365 | 42.33 |