C. H. Papadimitriou. Algorithms, games, and the Internet. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 749--753, Hersonissos, Crete, Greece, July 6--8, 2001. ACM Press, New York, NY. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Computing Equilibria in Multi-Player Games - Christos Papadimitriou Tim Self-citation (Papadimitriou Games) (Correct)
No context found.
C. H. Papadimitriou. Algorithms, games, and the Internet. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pages 749--753, 2001.
Multilateral Transport Games - Shepherd, Wilfong Self-citation (Games) (Correct)
No context found.
C. Papadimitriou. Algorithms, games, and the internet. In Proc. of ACM STOC, pages 749-753, 2001.
Computing Equilibria in Multi-Player Games - Papadimitriou, Roughgarden (2004) Self-citation (Papadimitriou Games) (Correct)
No context found.
C. H. Papadimitriou. Algorithms, games, and the Internet. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pages 749--753, 2001.
Tight Bounds for Worst-Case Equilibria - Artur Czumaj New (Correct)
No context found.
C. H. Papadimitriou. Algorithms, games, and the Internet. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 749--753, Hersonissos, Crete, Greece, July 6--8, 2001. ACM Press, New York, NY.
Selfish Traffic Allocation for Server Farms - Artur Czumaj Department (Correct)
No context found.
C. H. Papadimitriou. Algorithms, games, and the Internet. In Proc. 33rd ACM STOC, pp. 749--753, 2001.
Selfish Routing on the Internet - Artur Czumaj Department (Correct)
No context found.
C. H. Papadimitriou. Algorithms, games, and the Internet. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 749--753, Hersonissos, Crete, Greece, July 6--8, 2001. ACM Press, New York, NY.
An Incentive Mechanism for Message Relaying in - Peer-To-Peer Discovery Cuihong (Correct)
No context found.
C. H. Papadimitriou. Algorithms, games, and the internet. In Annual ACM Symposium on Theory of Computing (STOC), 2001.
Issues in Multiagent Resource Allocation - Chevaleyre, Dunne, al. (2006) (Correct)
No context found.
C. H. Papadimitriou. Algorithms, games, and the Internet. In Proc. 33rd Annual ACM Symposium on Theory of Computing (STOC-2001.
Fair File Swarming with FOX - Dave Levin Rob (Correct)
No context found.
C. Papadimitriou. Algorithms, Games, and the Internet. In STOC, 2001.
On Nash Equilibria in Stochastic Games - Chatterjee, Jurdzinski, Majumdar (2003) (Correct)
No context found.
C.H. Papadimitriou. Algorithms, games, and the internet. In STOC 01: Symposium on Theory of Computing, pages 749-753. ACM Press, 2001.
Nash Equilibrium for Upward-Closed Objectives - Chatterjee (2005) (Correct)
No context found.
C.H. Papadimitriou. Algorithms, games, and the internet. In STOC'01, pages 749-753. ACM Press, 2001.
Two-player Nonzero-sum ω-regular Games - Chatterjee (2004) (Correct)
No context found.
C.H. Papadimitriou. Algorithms, games, and the internet. In STOC 01: Symposium on Theory of Computing, pages 749-753. ACM Press, 2001.
An Incentive Mechanism for Message Relaying in Peer-to-Peer.. - Li, Yu, Sycara (Correct)
No context found.
C. H. Papadimitriou. Algorithms, games, and the internet. In Annual ACM Symposium on Theory of Computing (STOC), 2001.
DNA Starts to Learn Poker - David Harlan Wood (Correct)
No context found.
Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proceedings of the 33rd annual ACM Symposium on Theory of Computing: STOC'01, July 6--8, 2001, Hersonissos, Crete, Greece, ACM Press, New York (2001) 749--753
DNA Starts to Learn Poker - Wood, Bi, Kimbrough, Wu, Chen (Correct)
No context found.
Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proceedings of the 33rd annual ACM Symposium on Theory of Computing: STOC'01, July 6--8, 2001, Hersonissos, Crete, Greece, ACM Press, New York (2001) 749--753
Auctions with Severely Bounded Communication - Blumrosen, Nisan, Segal (2002) (9 citations) (Correct)
No context found.
Papadimitriou C. H. Algorithms, games, and the internet. In proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 749753, 2001.
How Much Can Taxes Help Selfish Routing? - Cole, Dodis, Roughgarden (Correct)
No context found.
C. H. Papadimitriou. Algorithms, games, and the Internet. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pages 749--753, 2001.
Mechanism Design for Online Real-Time Scheduling - Ryan Porter Computer (2004) (3 citations) (Correct)
No context found.
C. Papadimitriou, Algorithms, games, and the internet, STOC, 2001, pp. 749--753.
The Price of Stability for Network Design with Fair .. - Anshelevich.. (2004) (1 citation) (Correct)
No context found.
C. Papadimitriou. Algorithms, Games, and the Internet. In STOC, 749--753, 2001.
On Designing Incentives-Compatible Peer-to-Peer Systems - Ngan, Nandi, Singh.. (2004) (2 citations) (Correct)
No context found.
C. Papadimitriou. Algorithms, games, and the internet. In Proc. 33rd ACM STOC, pages 1--5, Hersonissos, Crete, Greece, July 2001.
How to Route and Tax Selfish Unsplittable Traffic - Auletta, De Prisco, Penna.. (2003) (Correct)
No context found.
C. H. Papadimitriou. Algorithms, Games, and the Internet. In Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 749--753, 2001. 15
Designing Networks for Selfish Users is Hard - Roughgarden (2002) (17 citations) (Correct)
No context found.
C. Papadimitriou. Algorithms, games, and the Internet. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pages 749--753, 2001.
Nash Equilibria in Competitive Societies, with Applications to.. - Vetta (2002) (4 citations) (Correct)
No context found.
C. Papadimitriou, \Algorithms, games, and the internet", Proceedings of the 33 rd Annual Symposium on the Theory of Computing, 2001.
Frugality in Path Auctions - Elkind, Sahai, Steiglitz (2004) (7 citations) (Correct)
No context found.
C. Papadimitriou, Algorithms, games, and the Internet, In Proceedings of the 33st Annual ACM Symposium on Theory of Computation, pages 749-753, 2001
How Bad is Selfish Routing? - Roughgarden, Tardos (2001) (Correct)
No context found.
C. Papadimitriou. Algorithms, games, and the Internet. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pages 749--753, 2001. 25
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC