Optimal auctions revisited

&
Artificial Intelligence 120 (1):29-42 (2000)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(00)00024-2

Links

PhilArchive



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

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

Optimal allocation mechanisms with type-dependent negative externalities.Isabelle Brocas - 2013 - Theory and Decision 75 (3):359-387.
Equilibrium Bidding without the Independence Axiom: A Graphical Analysis.Veronika Grimm - 2000 - Theory and Decision 49 (4):361-374.
Tractable combinatorial auctions and b-matching.Moshe Tennenholtz - 2002 - Artificial Intelligence 140 (1-2):231-243.
The Role of Defaultness in Affecting Pleasure: The Optimal Innovation Hypothesis Revisited.Rachel Giora, Shir Givoni, Vered Heruti & Ofer Fein - 2017 - Metaphor and Symbol 32 (1):1-18.
Algorithm for optimal winner determination in combinatorial auctions.Tuomas Sandholm - 2002 - Artificial Intelligence 135 (1-2):1-54.
Building economic machines: The FCC auctions.Francesco Guala - 2001 - Studies in History and Philosophy of Science Part A 32 (3):453-477.
Marta Herrero. “Auctions, Rituals and Emotions in the Art Market”. [REVIEW]Nataliya Komarova - 2011 - Russian Sociological Review 10 (1 — 2):79-82.
An Introduction to Auction Theory.Flavio M. Menezes - 2005 - Oxford University Press UK.
On the equivalence between descending bid auctions and first price sealed bid auctions.Edi Karni - 1988 - Theory and Decision 25 (3):211-217.
A near-optimal polynomial time algorithm for learning in certain classes of stochastic games.Ronen I. Brafman & Moshe Tennenholtz - 2000 - Artificial Intelligence 121 (1-2):31-47.
Endogenous entry in auctions with negative externalities.Isabelle Brocas - 2003 - Theory and Decision 54 (2):125-149.
Strong mediated equilibrium.Dov Monderer & Moshe Tennenholtz - 2009 - Artificial Intelligence 173 (1):180-195.
Time of day effects on problem solving: When the non-optimal is optimal.Mareike B. Wieth & Rose T. Zacks - 2011 - Thinking and Reasoning 17 (4):387 - 401.
Endogenous entry in lowest-unique sealed-bid auctions.Harold Houba, Dinard Laan & Dirk Veldhuizen - 2011 - Theory and Decision 71 (2):269-295.
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.

Analytics

Added to PP
2020-12-22

Downloads
2 (#1,784,141)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Tractable combinatorial auctions and b-matching.Moshe Tennenholtz - 2002 - Artificial Intelligence 140 (1-2):231-243.

Add more citations

References found in this work

No references found.

Add more references