See this document in CiteSeerX!

Making Markets and Democracy Work: A Story of Incentives and Computing (2003)  (Make Corrections)  (3 citations)
Tuomas Sandholm



  Home/Search   Context   Related

 
View or download:
cmu.edu/~sandholm/ctabstract.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cmu.edu/~sandholm/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Tuomas Sandholm Carnegie Mellon University Computer Science Department 5000 Forbes Avenue Pittsburgh, PA 15213 sandholm@cs.cmu.edu Abstract Collective choice settings are the heart of society. (Update)

Cited by:   More
Trust-Based Mechanism Design - Dash, Ramchurn, Jennings (2004)   (Correct)
A Mechanism for Multiple Goods and Interdependent - Dash   (Correct)

Active bibliography (related documents):   More   All
2.7:   Automated Mechanism Design: A New Application Area for Search.. - Sandholm (2003)   (Correct)
1.7:   Computational Criticisms of the Revelation Principle - Conitzer, Sandholm (2003)   (Correct)
1.3:   eMediator: A Next Generation Electronic Commerce Server - Sandholm (2002)   (Correct)

Similar documents based on text:   More   All
0.2:   Curriculum Vitae - Sandholm   (Correct)
0.2:   Minimal Preference Elicitation in Combinatorial Auctions - Conen, Sandholm (2001)   (Correct)
0.1:   Winner Determination in Combinatorial Auction.. - Sandholm, Suri, Gilpin.. (2001)   (Correct)

Related documents from co-citation:   More   All
3:   An Exploration in the Theory of Optimum Income Taxation (context) - Mirrlees - 1971
3:   Efficient Design with Interdependent Valuations - Philippe, Moldovanu - 1999
3:   Quarterly Journal of Economics (context) - Dasgupta, Maskin - 2000

BibTeX entry:   (Update)

T. Sandholm. Making markets and democracy work: A story of incentives and computing. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 1649--1671, 2003. http://citeseer.ist.psu.edu/sandholm03making.html   More

@misc{ sandholm03making,
  author = "T. Sandholm",
  title = "Making markets and democracy work: A story of incentives and computing",
  text = "T. Sandholm. Making markets and democracy work: A story of incentives and
    computing. In Proceedings of the International Joint Conference on Artificial
    Intelligence (IJCAI), pages 1649--1671, 2003.",
  year = "2003",
  url = "citeseer.ist.psu.edu/sandholm03making.html" }
Citations (may not include all citations):
494   The contract net protocol: High-level communication and cont.. (context) - Smith - 1980
215   Multipart pricing of public goods (context) - Clarke - 1971
214   Incentives in teams (context) - Groves - 1973
184   Computationally manageable combinatorial auctions - Rothkopf, Peke et al. - 1998
177   An implementation of the contract net protocol based on marg.. - Sandholm - 1993
174   and competitive sealed tenders (context) - Vickrey, auctions - 1961
147   Taming the computational complexity of combinatorial auction.. (context) - Fujishima, LeytonBrown et al. - 1999
137   Issues in automated negotiation and electronic commerce: Ext.. - Sandholm, Lesser - 1997
128   Bidding and allocation in combinatorial auctions - Nisan - 2000
119   The Hungarian method for the assignment problem (context) - Kuhn - 1955
114   Oxford University Press (context) - Mas-Colell, Whinston et al. - 1995
87   Computationally feasible VCG mechanisms - Nisan, Ronen - 2000
76   CABOB: A fast optimal algorithm for combinatorial auctions - Sandholm, Suri et al. - 2001
69   Iterative combinatorial auctions: Theory and practice - Parkes, Ungar - 2000
69   Mathematics of Operation Research (context) - Myerson, design - 1981
63   A combinatorial auction mechanism for airport time slot allo.. (context) - Rassenti, Smith et al. - 1982
63   Integer programming for combinatorial auction winner determi.. - Andersson, Tenhunen et al. - 2000
60   Negotiation among Self-Interested Computationally Limited Ag.. (context) - Sandholm - 1996
55   Algorithmic mechanism design - Nisan, Ronen - 2001
43   The Clarke tax as a consensus mechanism among automated agen.. (context) - Ephrati, Rosenschein - 1991
42   Complexity of mechanism design - Conitzer, Sandholm - 2002
41   Optimal solutions for multi-unit combinatorial auctions: Bra.. - Gonen, Lehmann - 2000
40   Preference elicitation in combinatorial auctions: Extended a.. - Conen, Sandholm - 2001
38   Constraintdirected negotiation of resource reallocations (context) - Sathi, Fox - 1989
38   Equilibrium analysis of the possibilities of unenforced exch.. - Sandholm, Lesser - 1995
36   Some tractable combinatorial auctions - Tennenholtz - 2000
35   Ripping coins for fair exchange - Jakobsson - 1995
34   Partial-revelation VCG mechanism for combinatorial auctions - Conen, Sandholm - 2002
33   Strategy-proofness and Arrow's conditions: existence and cor.. (context) - Satterthwaite - 1975
32   Contract types for satisficing task allocation: I theoretica.. - Sandholm - 1998
31   Incentives in Public Decision Making (context) - Green, Laffont - 1979
31   Winner determination in combinatorial auction generalization.. - Sandholm, Suri et al. - 2001
29   Bidding languages for combinatorial auctions - Hoos, Boutilier - 2001
29   Algorithms for optimizing leveled commitment contracts - Sandholm, Sikka et al. - 1999
28   Multi-agent planning as a dynamic search for social consensu.. - Ephrati, Rosenschein - 1993
28   Incentives and incomplete information (context) - d'Aspremont, erard-Varet - 1979
28   A new and improved design for multiobject iterative auctions - DeMartini, Kwasnica et al. - 1999
27   The property rights doctrine and demand revelation under inc.. (context) - Arrow - 1979
27   Towards a universal test suite for combinatorial auction alg.. - Leyton-Brown, Pearson et al. - 2000
25   Algorithms for distributed constraint satisfaction: A review - Yokoo - 2000
25   Approaches to winner determination in combinatorial auctions - Sandholm - 2000
25   Combinatorial auctions for supply chain formation - Walsh, Wellman et al. - 2000
24   Costly valuation computation in auctions - Larson, Sandholm - 2001
24   Manipulation of voting schemes (context) - Gibbard - 1973
24   approximately efficient combinatorial auctions (context) - Lehmann, O'Callaghan et al. - 2002
23   Linear programming and Vickrey auctions - Bikhchandani, de Vries et al. - 2001
19   Agents in electronic commerce: Component technologies for au.. (context) - Sandholm - 2000
19   Bargaining with limited computation: Deliberation equilibriu.. - Larson, Sandholm - 2000
16   Single transferable vote resists strategic voting (context) - Bartholdi, Orlin - 1991
16   Vote elicitation: Complexity and strategyproofness - Conitzer, Sandholm - 2002
15   Computationally limited agents in auctions - Larson, Sandholm - 2001
15   Computational aspects of clearing continuous call double auc.. (context) - Kalagnanam, Davenport et al. - 2001
15   Market clearability - Sandholm, Suri - 2001
15   Universal voting protocol tweaks to make manipulation hard - Conitzer, Sandholm - 2003
15   Complexity of manipulating elections with few candidates - Conitzer, Sandholm - 2002
15   Side constraints and non-price attributes in markets - Sandholm, Suri - 2001
14   A non-manipulable meeting scheduling system - Ephrati - 1994
13   Online algorithms for market clearing - Blum, Sandholm et al. - 2002
13   The computational difficulty of manipulating an election (context) - Bartholdi, Tovey et al. - 1989
12   Bundling and optimal auctions of multiple products (context) - Avery, Hendershott - 2000
12   Computational criticisms of the revelation principle - Conitzer, Sandholm - 2003
11   Effectiveness of preference elicitation in combinatorial auc.. - Hudson, Sandholm - 2002
11   Automated mechanism design: Complexity results stemming from.. - Conitzer, Sandholm - 2002
11   Preference elicitation and query learning - Blum, Jackson et al. - 2003
11   On polynomial-time preference elicitation with value queries - Zinkevich, Blum et al. - 2003
11   Research problems in combinatorial auctions (context) - Vohra - 2001
11   An algorithm for multi-unit combinatorial auctions - Leyton-Brown, Tennenholtz et al. - 2000
10   Optimal multi-object auctions (context) - Armstrong - 2000
10   Constructing and clearing combinatorial exchanges using pref.. - Smith, Sandholm et al. - 2002
8   How many candidates are needed to make elections hard to man.. - Conitzer, Lang et al. - 2003
8   An alternating offers bargaining model for computationally l.. - Larson, Sandholm - 2002
8   Differential-revelation VCG mechanisms for combinatorial auc.. - Conen, Sandholm - 2002
7   Safe exchange planner - Sandholm, Ferrandon - 2000
7   Solving combinatorial exchanges: Optimality via few partial .. - Kothari, Sandholm et al. - 2003
6   A strategy for decreasing the total transportation costs amo.. (context) - Sandholm - 1991
6   The communication requirements of efficient allocations and .. - Nisan, Segal - 2003
6   Multistage negotiation for distributed satisfaction (context) - Conry, Kuwabara et al. - 1991
6   Special issue on Electronic Commerce (context) - Sandholm, transactions et al. - 1997
5   anonymousprice combinatorial auction (context) - Wurman, Wellman et al. - 2000
5   Surplus equivalence of leveled commitment contracts - Sandholm, Zhou - 2002
5   Leveled commitment contracting: A backtracking instrument fo.. - Sandholm, Lesser - 2002
5   Special Issue on Applying Intelligent Agents for Electronic .. (context) - Sandholm, computational et al. - 1996
5   Time-quality tradeoffs in reallocative negotiation with comb.. - Andersson, Sandholm - 1999
5   Contract type sequencing for reallocative negotiation - Andersson, Sandholm - 2000
4   Deviation-proof plans in open multiagent environments (context) - Braynov - 1994
4   Case study white paper at www (context) - Inc, negotiations et al. - 2003
4   Case study white paper at www (context) - Inc, manufacturer et al. - 2003
4   Optimal clearing supplydemand curve - Suri, Subhash et al. - 2002
4   Case study white paper at www (context) - Inc, enhances et al. - 2003
4   Solving concisely expressed combinatorial auction problems - Boutilier - 2002
4   Case study white paper at www (context) - Inc, essential et al. - 2003
3   Using value queries in combinatorial auctions - Hudson, Sandholm - 2003
3   of automated mechanism design, 2003. Sandholm. Automated mec.. (context) - Conitzer, Sandholm - 2003
3   Truthful approximate mechanisms for restricted combinatorial.. (context) - Mu'alem, Nisan - 2002
3   New NCL survey shows consumers are both excited and confused.. (context) - League - 1999
3   Miscomputing ratio: The social cost of selfish computing - Larson, Sandholm - 2003
3   possibility of safe exchange mechanism design (context) - Sandholm, Wang - 2002
2   Defection-free exchange mechanisms for information goods (context) - Matsubara, Yokoo - 2000
2   Efficient mechanisms for bilateral exchange (context) - Myerson, Satterthwaite - 1983
2   Automated mechanism design with a structured outcome space - Conitzer, Sandholm - 2003
2   Special issue on distributed artificial intelligence SMC (context) - Sycara, Roth et al. - 1991
1   dependence and stability in multiagent plans (context) - Braynov, Sandholm - 1999
1   Major industrial manufacturer identifies best strategy for o.. (context) - Inc - 2003
1   Generalizing preference elicitation in combinatorial auction.. - Hudson, Sandholm - 2003
1   Special Issue on Agent-Based Computational Economics (context) - Andersson, Sandholm et al. - 1998
1   Distributed quiescence detection in multiagent negotiation (context) - Walsh, Wellman - 2000

Documents on the same site (http://www-2.cs.cmu.edu/~sandholm/):   More
Miscomputing Ratio: The Social Cost of Selfish Computing - Larson, Sandholm (2003)   (Correct)
Complexity of Determining Nonemptiness of the Core - Conitzer, Sandholm (2002)   (Correct)
Definition and Complexity of Some Basic Metareasoning Problems - Conitzer, Sandholm (2002)   (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