Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 416-425

  Vetta, Adrian ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); DECISION MAKING; ECONOMICS; FACILITIES; GAME THEORY; GRAPH THEORY; OPTIMIZATION; SOCIETIES AND INSTITUTIONS; THEOREM PROVING;

AUCTIONS; COMPETITIVE SOCIETIES; FACILITY LOCATION; NASH EQUILIBRIA; NON COOPERATIVE GAMES; SUBMODULAR UTILITY FUNCTIONS; TRAFFIC ROUTING;

COMPUTER SCIENCE;

EID: 0036948876     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. M. Conforti and G. Cornuéjols, "Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Radio-Edmonds theorem", Discrete Applied Mathematics, 7, pp251-274, 1984.
2. G. Cornéjols, M. Fischer and G. Nemhauser, "Location of bank accounts to optimize float: an analytic study of exact and approximation algorithms", Manag. Sci., 23, pp789-810, 1977.
3. M. Charikar, S. Guha, E. Tardos and D. Shmoys, "A constant-factor approximation algorithm for the k-median problem", Proc. 31st STOC, pp1-10, 1999.
4. M. Fisher, G. Nemhauser and L. Wosley, "An analysis of approximations for maximising submodular set functions II", Math. Prog. Study, 8, pp73-87, 1978.
5. E. Koutsoupias and C. Papadimitriou, "Worst-case equilibria", Proc. 16th STACS, pp404-413, 1999.
6. B. Lehmann, D. Lehmann and N. Nisan, "Combinatorial auctions with decreasing marginal utilities", ACM Conf. on Electronic Commerce, 2001.
7. J. Nash, "Non-cooperative games", Annals of Mathematics, 54, pp268-95, 1951.
8. C. Papadimitriou, "Algorithms, games, and the internet", Proc. 33rd STOC, 2001.
9. T. Roughgarden and E. Tardos, "How bad is selfish routing?", Proc. 41st FOCS, pp93-102, 2000.