Game theory and mathematical economics: A theoretical computer scientist's introduction

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 4-8

  Papadimitriou, C H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; LINEAR PROGRAMMING;

MATHEMATICAL ECONOMICS;

GAME THEORY;

EID: 0035172236     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959877     Document Type: Conference Paper

References (52)

1. The relative complexity of NP search problems
2. On the complexity of cooperative game solution concepts
3. Decision-making by hierarchies of discordant agents
4. A cryptographic solution to a game theoretic problem
5. Rank aggregation methods for the web
6. Sharing the cost of multicast transmissions
7. Optimality and domination in repeated games with bounded players
8. Competitive auctions and digital goods
9. Exponential lower bounds for finding brouwer fixpoints
10. Applications of approximation algorithms to cooperative games
11. On the value of private information
12. Worst-case equilibria
13. Competitive analysis of online auctions
14. Combinatorial auctions with decreasing marginal utilities
15. The price of selfish routing
16. Privacy preserving auctions and mechanism design
17. Algorithms for selfish agents - Mechanism design for distributed computation
18. Bidding and allocation in combinatorial auctions
19. Algorithmic mechanism design
20. Computationally efficient VCG mechanisms
21. Algorithms, games, and the Internet
22. On the complexity of the parity argument and other inefficient proofs of existence
23. On complexity as bounded rationality
24. Iterative combinatorial auctions: Theory and practice
25. Stackelberg scheduling strategies
26. How bad is selfish routing?
27. Distributed rational decision making
28. An algorithm for optimal winner determination in combinatorial auctions
29. Improved algorithms for optimal winner determination in combinatorial auctions and generalizations
30. Games in logic
31. Economic mechanism design for computerized agents