Algorithms, games, and the internet

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 749-753

  Papadimitriou, C H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; INTERNET; MATRIX ALGEBRA; OPTIMIZATION; SET THEORY; TOPOLOGY;

MATHEMATICAL ECONOMICS;

GAME THEORY;

EID: 0034836562     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380883     Document Type: Conference Paper

References (30)

1. Alternation
2. On the complexity of cooperative game solution concepts
3. On power-law relationships of the Internet topology
4. Sharing the cost of multicast transmissions
5. Mathematical modelling of the Internet
6. Optimization problems in congestion control
7. Authoritative sources in a hyperlinked environment
8. On the value of private information
9. Segmentation problems
10. Worst-case equilibria
11. Random graph models for the Web graph
12. Algorithms for selfish agents - Mechanism design for distributed computation
13. Algorithmic mechanism design
14. On the complexity of the parity argument and other inefficient proofs of existence
15. Complexity as bounded rationality
16. Probabilistic construction of deterministic algorithms: Approximate packing integer programs
17. How bad is selfish routing? (extended abstract)
18. Nash convergence of gradient dynamics in General-Sum games
19. Probabilistic computations: Toward a unified measure of complexity (extended abstract)