See this document in CiteSeerX!

LNAI volume of AMEC/TADA, 2006  (Make Corrections)  
Algorithms for Distributed Winner Determination In Combinatorial Auctions...



  Home/Search   Context   Related

 
View or download:
sc.edu/papers/narumanchi06a.pdf
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  sc.edu/papers/ (more)
(Enter author homepages)

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

Abstract: The problem of optimal winner determination in combinatorial auctions consists of finding the set of bids that maximize the revenue for the sellers. Various solutions exist for solving this problem but they are all centralized. That is, they assume that all bids are sent to a centralized auctioneer who then determines the winning set of bids. In this paper we introduce the problem of distributed winner determination in combinatorial auctions which eliminates the centralized auctioneer. ... (Update)

Active bibliography (related documents):   More   All
1.4:   Agent-Mediated Electronic Commerce VII, 2005. - Algorithms For Distributed   (Correct)
0.3:   Query Incentive Networks - Jon Kleinberg Prabhakar   (Correct)
0.2:   Achieving Budget-Balance with Vickrey-Based Payment Schemes in.. - Parkes (2002)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ distributed-lnai,
  author = "Algorithms For Distributed",
  title = "LNAI volume of AMEC/TADA, 2006.",
  url = "citeseer.ist.psu.edu/738127.html" }
Citations (may not include all citations):
147   Taming the computational complexity of combinatorial auction.. (context) - Fujishima, Leyton-Brown et al. - 1999
137   Algorithmic mechanism design - Nisan, Ronen - 2001
128   Bidding and allocation in combinatorial auctions - Nisan - 2000
99   Rules of Encounter (context) - Rosenschein, Zlotkin - 1994
85   Combinatorial auctions: A survey - de Vries, Vohra - 2003
66   Market-oriented programming: Some early lessons - Wellman - 1996
63   Integer programming for combinatorial auction winner determi.. - Andersson, Tenhunen et al. - 2000
61   Distributed algorithmic mechanism design: Recent results and.. - Feigenbaum, Shenker - 2002
61   Methods for task allocation via agent coalition formation - Shehory, Kraus - 1998
29   Towards a universal test suite for combinatorial auction alg.. (context) - Leyton-Brown, Pearson et al. - 2000
28   Solving combinatorial auctions using stochastic local search - Hoos, Boutilier - 2000
24   Computationally manageable combinational auctions (context) - Rothkopf, Pekec et al. - 1998
14   Algorithm design for agents which participate in multiple si.. - Preist, Bartolini et al. - 2001
10   An algorithm for winner determination in combinatorial aucti.. (context) - Sandholm - 2002
9   NetLogo: Center for connected learning and computer-based mo.. (context) - Wilensky - 1999
7   Economic dynamics of agents in multiple auctions - Preist, Byde et al. - 2001
5   cient approximate allocation algorithm for combinatorial auc.. (context) - Zurel, Nisan et al. - 2001
3   Economic properties of social networks - Kakade, Kearns et al. - 2005
2   Network Exchange Theory (context) - Willer - 1999

Documents on the same site (http://jmvidal.cse.sc.edu/papers/):   More
Biter: A Platform for the Teaching and Research of Multiagent.. - Buhler, Vidal (2001)   (Correct)
Semantic Web Services as Agent Behaviors - Buhler, Vidal (2003)   (Correct)
Automatic Verification of a Class of Symmetric Parallel Programs - Szymanski, Vidal (1994)   (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