(Enter summary)
Abstract: v
1 Introduction 1
1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.1.1 Game theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.1.2 Mechanism Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.1.3 Some fundamental concepts of theoretical computer science . . . . . . . . . . 6
1.1.4 Game theoretic considerations in computer science . . . . . . . . . . . . . . . 8
1.2 Overview of the... (Update)
Context of citations to this paper: More
.... not study Nash equilibria but is nevertheless concerned with controlling selfish behavior is that of algorithmic mechanism design [13, 20, 21, 25]. In this setting, an algorithm is designed to collect data from users and compute an outcome using this data (e.g. based on the...
...basic problems (e.g. shortest path, minimum spanning tree, etc. have been (re ) considered in the context of selfish agents [NR99, Ron00]: a network graph is composed by a set of weighted edges, each of them owned by an agent that privately knows the corresponding...
Cited by: More
Energy Consumption in Radio Networks: Selfish.. - Ambühl, Clementi, .. (2003)
(Correct)
Sharing the Cost of Multicast Transmissions in Wireless Networks - Penna, Ventre (2003)
(Correct)
Deterministic Truthful Approximation Mechanisms for .. - Auletta, De.. (2003)
(Correct)
Similar documents (at the sentence level):
60.3%: Solving Optimization Problems among Selfish Agents - Ronen (2000)
(Correct)
32.6%: Computationally Feasible VCG Mechanisms - Nisan, Ronen (2000)
(Correct)
19.8%: Algorithmic Mechanism Design - Nisan, Ronen (1999)
(Correct)
Active bibliography (related documents): More All
3.6: Algorithms for Rational Agents - Ronen (2000)
(Correct)
0.5: Algorithms for Selfish Agents - Mechanism Design for Distributed.. - Nisan (1999)
(Correct)
0.5: Bidding and Allocation in Combinatorial Auctions - Nisan (1999)
(Correct)
Similar documents based on text: More All
0.5: .1 Mechanism Design and the Revelation Principle - Last Class We
(Correct)
0.5: Mechanism Design with Incomplete Languages - Ronen (2001)
(Correct)
0.3: Distributed Algorithmic Mechanism Design: Recent Results.. - Feigenbaum, Shenker (2002)
(Correct)
Related documents from co-citation: More All
6: Algorithmic mechanism design
- Nisan, Ronen - 1999
4: Incentives in Teams (context) - Groves - 1973
4: Sharing the cost of multicast transmissions
- Feigenbaum, Papadimitriou et al. - 2000
BibTeX entry: (Update)
A. Ronen. Solving Optimization Problems among Selfish Agents. PhD thesis, Hebrew University of Jerusalem, 2000. http://citeseer.ist.psu.edu/ronen00solving.html More
@misc{ ronen00solving,
author = "A. Ronen",
title = "Solving Optimization Problems among Selfish Agents",
text = "A. Ronen. Solving Optimization Problems among Selfish Agents. PhD thesis,
Hebrew University of Jerusalem, 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/ronen00solving.html" }
Citations (may not include all citations):
1529
A method for obtaining digital signatures and public key cry..
- Rivest, Shamir et al. - 1978
625
ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
534
The complexity of theorem proving procedures (context) - Cook - 1970
494
The contract net protocol: High level communication and cont.. (context) - Smith - 1980
356
Computers and Intractability : A Guide to the Theory of NP-C.. (context) - Garey, Johnson - 1979
318
Approximation Algorithms for NP-Hard Problems (context) - Hochbaum - 1997
309
Game Theory (context) - Fudenberg, Tirole - 1991
282
A Course in Game Theory (context) - Osborne, Rubinstein - 1994
243
Rules of Encounter: Designing Conventions for Automated Nego.. (context) - rey, Rosenschein et al. - 1994
219
Completeness theorems for noncryptographic fault-tolerant di.. (context) - Ben-Or, Goldwasser et al. - 1988
215
Multipart pricing of public goods (context) - Clarke - 1971
214
Incentives in teams (context) - Groves - 1973
187
Polynomial time approximation schemes for euclidean tsp and ..
- Arora - 1996
184
Computationally manageable combinatorial auctions
- Harstad, Pekec - 1995
158
Analysis and simulation of a fair queuing algorithm (context) - Demers, Keshav - 1990
150
Computational Complexity (context) - Papadimitriou - 1994
147
Taming the computational complexity of combinatorial auction.. (context) - Fujishima, Leyton-Brown et al. - 1999
140
How to play any mental game or a completeness theorem for pr.. (context) - Goldreich, Micali et al. - 1987
137
Algorithmic mechanism design
- Nisan, Ronen - 2000
137
Algorithmic mechanism design
- Nisan, Ronen - 1999
130
Pricing in computer networks: reshaping the research agenda
- Shenker, Estrin et al. - 1996
130
Pricing in computer networks: Reshaping the research agenda
- Shenkar, Hertzog - 1996
128
Bidding and allocation in combinatorial auctions
- Nisan
122
Making greed work in networks: a game theoretic analysis of ..
- Shenker - 1994
114
Oxford university press (context) - Mas-Collel, Green - 1995
108
Introduction to the Theory of Computation (context) - Sipser - 1996
99
Handbook of Theoretical Computer Science (context) - Van Leeuwen - 1990
96
auctions and competitive sealed tenders (context) - Vickrey - 1961
95
Sharing the cost of multicast transmissions
- Feigenbaum, Papadimitriou et al. - 2000
92
A compendium of np optimization problems
- Kann, Crescenzi
89
Limitations of the vickrey auction in computational multiage..
- Sandholm - 1996
87
Computationally feasible vcg mechanisms
- Nisan, Ronen - 2000
86
Auction theory: a guide to the literature (context) - Klemperer - 1999
85
Worst-case equilibria
- Koutsoupias, Papadimitriou - 1999
83
Economic models for allocating resources in computer systems
- Ferguson, Nikolaou et al. - 1995
79
Selling spectrum rights (context) - McMillan - 1994
79
Privacy preserving auctions and mechanism design
- Naor, Pinkas et al. - 1999
78
Auction protocols for decentralized scheduling
- Walsh, Wellman et al. - 1998
67
Games with incomplete information played by 'bayesian' playe.. (context) - Harsanyi - 1967
61
Proof verication and hardness of approximation problems
- Arora, Lund et al. - 1992
55
Manipulation of voting schemes: a general result (context) - Gibbard - 1973
54
Putting auction theory to work: the simultaneous ascending a..
- Milgrom - 1998
52
The Foundations of Cryptography
- Goldreich - 2000
46
A market protocol for decentralized task allocation: Extende..
- Walsh, Wellman - 1998
44
Problems of information transmission (context) - Levin, problems - 1973
43
Characterization of satisfactory mechanisms for the revelati.. (context) - Green, La - 1977
43
optimal allocation and quality of service provisioning in hi.. (context) - Sairamesh, Ferguson et al. - 1995
41
Quality of service provision in noncooperative networks: het..
- Park, Sithram et al. - 1998
41
Optimal solutions for multi-unit combinatorial auctions: Bra..
- Gonen, Lehmann
40
Paris metro pricing for the internet
- Odlyzko - 1999
39
Modeling Bounded Rationality (context) - Rubinstein - 1998
39
Agents contracting tasks in non-collaborative environments (context) - Kraus - 1993
39
Flow control using the theory of zero sum markov games
- Altman - 1994
37
Strategic Negotiation in Multi-Agent Environments (context) - Kraus - 2001
36
Some tractable combinatorial auctions
- Tennenholtz - 2000
35
Exact and approximate algorithms for scheduling nonidentical.. (context) - Horowitz, Sahni - 1976
27
A general-equilibrium approach to distributed transportation.. (context) - Wellman - 1992
26
Learning and implementation on the internet
- Friedman, Shenker
26
approximately ecient combinatorial auctions (context) - Lehmann, OCallaghan et al. - 1999
25
Approaches to winner determination in combinatorial auctions
- Sandholm
24
The fcc spectrum auction: an early assessment
- Cramton - 1997
21
The progressive second price auction mechanism for network r..
- Lazar, Semret - 1998
21
Optimal auctions revisited
- Monderer, Tennenholtz - 1998
21
Clique is hard to approximate within n (context) - astad - 1996
17
Distributed computation as an economic system (context) - Huberman, Hogg - 1995
17
Distributed games: From mechanisms to protocols
- Monderer, Tennenholtz - 1999
14
Algorithms for selsh agents (context) - Nisan - 1999
14
Strong signature schemes (context) - Goldwasser, Micali et al. - 1983
13
Applying game theory to automated negotiation (context) - Vulkan, Binmore
13
The characterization of implementable choise rules (context) - Roberts - 1979
13
Game theoretic aspects of computing (context) - Lineal - 1994
11
A dynamic theory of incentives in multi-agent systems (context) - Shoham, Tanaka - 1997
11
Auction Theory for Privatization (context) - Milgrom - 1998
10
Special Issue on Advances in the Fundamentals of Networking (context) - Korilis, Lazar et al. - 1991
10
Algorithms for rational agents
- Ronen - 2000
9
Private communication (context) - Maskin - 2000
9
Private communication (context) - Lehmann - 1999
9
Strategy-proofness and arrow's condition: Existence and corr.. (context) - Satterthwaite - 1975
9
On play by means of computing machines (context) - Megiddo, Wigderson - 1986
8
New York: Wiley (context) - Arrow, individual - 1963
8
Competitive analysis of online auctions (context) - Lavi, Nisan
7
Linear programming without the matrix (context) - Papadimitriou, Yannakakis - 1993
7
the value of information in distributed decision-making (context) - Papadimitriou, Yannakakis - 1991
7
Theoretical Computer Science (context) - Spencer, derandomization et al. - 1994
6
To appear in Games and Economic Behaviour (context) - Monderer, Tennenholtz
6
Approximation algorithms for scheduling unrelated parallel m.. (context) - Lenstra, Shmoys et al. - 1987
5
Planning and consensus among autonomous agents
- Ephrati - 1993
5
The clarke tax as a concensus mechanism among automated agen.. (context) - Ephrati, rey et al. - 1991
5
An exploration in the theory of optimal income taxation (context) - Mirrlees - 1971
5
Computational aspects of organization theory (context) - Papadimitriou - 1996
4
the existence of equilibiriua in noncooperative optimal ow c.. (context) - Korilis, Lazar - 1995
4
chapter Markets and Computation: Agoric open systems (context) - Miller, Drexler - 1988
3
Elsevier Science Publishers/NorthHolland (context) - Huberman, The et al. - 1988
3
Web Page: http://www (context) - inc
3
Cambridge Univ Press (context) - Motwani, Raghavan - 1995
3
report to the california trust for power industry restructur.. (context) - Wilson, for et al. - 1997
3
Rational computation and the coomunication complexity of auc.. (context) - Shoham, Moshe
2
Data Management Series (context) - Lynch - 1997
2
information goods intellectual property and related issues (context) - Varian, of
2
chapter Implementation Theory (context) - Palfrey, Game - 1995
2
Equlibrium points in n-person games (context) - Nash - 1950
2
Market-oriented programming (context) - Michael
2
Strategy-proof voting schemes with continuos preferences (context) - Barbera - 1990
2
An implementation of the contract net protocol based on marg.. (context) - Sandhulm - 1993
2
Complexity of some two person perfect information games (context) - Scha - 1978
2
Uber eine anwendung der mengnlehre auf die theorie des schac.. (context) - Zermelo - 1913
2
Mechanisms for Automated Negotiation among Autonomous Agents (context) - Zlotin - 1994
2
Handbook of Game Theory (context) - Auman, editors - 1995
2
Bidding clubs: Institutionalized collusion in auctions
- Leyton-Brown, Tennenholtz et al.
1
Resolving goal con icts via negotiation (context) - Sycara - 1988
1
of Experimental and Theoretical Articial Intelligence (context) - Ephrati, Kraus et al. - 1991
1
Surng as a real option (context) - Lukose, Huberman - 1998
1
John Weily and Sons (context) - von Neumann, theory et al. - 1944
1
Eciency and equilibrium in task allocation economies with hi.. (context) - Walsh, Wellman - 1999
1
Optimal decentralized ow control (context) - Hsiao - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.huji.ac.il/~amiry/): More
Algorithmic Mechanism Design - Nisan, Ronen (1999)
(Correct)
Computationally Feasible VCG Mechanisms - Nisan, Ronen (2000)
(Correct)
Algorithms for Rational Agents - Ronen (2000)
(Correct)
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