The price of anarchy for polynomial social cost
- 1 December 2006
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 369 (1-3), 116-135
- https://doi.org/10.1016/j.tcs.2006.07.055
Abstract
No abstract availableKeywords
Funding Information
- European Commission (001907, 015964, IST-2001-33116)
- Deutsche Forschungsgemeinschaft
- Vedecká Grantová Agentúra MŠVVaŠ SR a SAV (2/3164/23)
- University of Cyprus
This publication has 20 references indexed in Scilit:
- Structure and complexity of extreme Nash equilibriaTheoretical Computer Science, 2005
- Approximate Equilibria and Ball FusionTheory of Computing Systems, 2003
- Competitive routing in networks with polynomial costsIEEE Transactions on Automatic Control, 2002
- How bad is selfish routing?Journal of the ACM, 2002
- The effect on equilibrium trip assignment of different link congestion functionsTransportation Research Part A: General, 1981
- Subjectivity and correlation in randomized strategiesJournal of Mathematical Economics, 1974
- A class of games possessing pure-strategy Nash equilibriaInternational Journal of Game Theory, 1973
- Non-Cooperative GamesAnnals of Mathematics, 1951
- Equilibrium points in n -person gamesProceedings of the National Academy of Sciences, 1950
- Exponential PolynomialsAnnals of Mathematics, 1934