Algorithm for optimal winner determination in combinatorial auctions

Artificial Intelligence 135 (1-2):1-54 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(01)00159-x

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

BOB: Improved winner determination in combinatorial auctions and generalizations.Tuomas Sandholm & Subhash Suri - 2003 - Artificial Intelligence 145 (1-2):33-58.
Modelling Combinatorial Auctions in Linear Logic.Daniele Porello & Ulle Endriss - 2010 - In Daniele Porello & Ulle Endriss (eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, {KR} 2010, Toronto, Ontario, Canada, May 9-13, 2010.
The winner’s curse in auctions with losses.Matteo Migheli - 2017 - Mind and Society 16 (1-2):113-126.
Optimal allocation mechanisms with type-dependent negative externalities.Isabelle Brocas - 2013 - Theory and Decision 75 (3):359-387.
Preference elicitation and robust winner determination for single- and multi-winner social choice.Tyler Lu & Craig Boutilier - 2020 - Artificial Intelligence 279 (C):103203.
Tractable combinatorial auctions and b-matching.Moshe Tennenholtz - 2002 - Artificial Intelligence 140 (1-2):231-243.
Winner‐relaxing and winner‐enhancing Kohonen maps: Maximal mutual information from enhancing the winner.Jens Christian Claussen - 2003 - Complexity 8 (4):15-22.
Equilibrium Bidding without the Independence Axiom: A Graphical Analysis.Veronika Grimm - 2000 - Theory and Decision 49 (4):361-374.
The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions.Valeria Fionda & Gianluigi Greco - 2013 - Artificial Intelligence 196 (C):1-25.
Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions.Baharak Rastegari, Anne Condon & Kevin Leyton-Brown - 2011 - Artificial Intelligence 175 (2):441-456.
Optimal auctions revisited.Dov Monderer & Moshe Tennenholtz - 2000 - Artificial Intelligence 120 (1):29-42.
Invitation to fixed-parameter algorithms.Rolf Niedermeier - 2006 - New York: Oxford University Press.
The determination of the past and the future of a physical system in quantum mechanics.Paul Busch & Pekka J. Lahti - 1989 - Foundations of Physics 19 (6):633-678.
A Multiobjective Genetic Algorithm for the Localization of Optimal and Nearly Optimal Solutions Which Are Potentially Useful: nevMOGA.Alberto Pajares, Xavier Blasco, Juan M. Herrero & Gilberto Reynoso-Meza - 2018 - Complexity 2018:1-22.
Optimal search strategies for optimal motor solutions: Self-determination or informed guidance?C. B. Walter & K. Kamm - 1996 - Behavioral and Brain Sciences 19 (1):91-92.

Analytics

Added to PP
2020-12-22

Downloads
4 (#1,590,841)

6 months
3 (#1,023,809)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Preferences in AI: An overview.Carmel Domshlak, Eyke Hüllermeier, Souhila Kaci & Henri Prade - 2011 - Artificial Intelligence 175 (7-8):1037-1052.

View all 11 citations / Add more citations

References found in this work

Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.

Add more references