2026-07-21T14:57:48Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:207 2024-03-06T11:06:07Z ddc:004 open_access

Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation Sandholm, Tuomas Gilpin, Andrew compact representation of games congestion games local-effect games action-graph gamescomputational markets; auctions; bidding strategiesNegotiatio We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to retain much of their private valuation information, yet generates close-to-optimal expected utility for the seller. We show that if each buyer receives at most one offer, each buyers dominant strategy is to act truthfully. In more general TLAs, the buyers optimal strategies are more intricate, and we derive the perfect Bayesian equilibrium for the game. We develop algorithms for finding the equilibrium and also for optimizing the offers so as to maximize the sellers expected utility. In several example settings we show that the sellers expected utility already is close to optimal for a small number of offers. As the number of buyers increases, the sellers expected utility increases, and becomes increasingly (but not monotonically) more competitive with Myersons expected utility maximizing auction. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Tuomas Sandholm and Andrew Gilpin 2005 Is Part Of Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.05011.16 urn:nbn:de:0030-drops-2075 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.16 eng https://creativecommons.org/licenses/by/4.0/legalcode