License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07271.7
URN: urn:nbn:de:0030-drops-11616
Go to the corresponding Portal

Grigorieva, Elena ; Herings, P. Jean-Jacques ; Müller, Rudolf ; Vermeulen, Dries

Inefficiency of equilibria in query auctions with continuous valuations

07271.MuellerRudolf.Paper.1161.pdf (0.2 MB)


We show that, when bidders have continuous valuations, any ex post
equilibrium in an ex post individually rational query auction can only be
ex post efficient when the running time of the auction is infinite for almost
all realizations of valuations of the bidders. In contrast we show that,
when we allow for inefficient allocations with arbitrarily small probability,
there is a query auction (to be more specific, a bisection auction) that attains this level of approximate efficiency in equilibrium, while additionally the
running time of the auction in equilibrium is finite for all realizations of

BibTeX - Entry

  author =	{Grigorieva, Elena and Herings, P. Jean-Jacques and M\"{u}ller, Rudolf and Vermeulen, Dries},
  title =	{{Inefficiency of equilibria in query auctions with continuous valuations}},
  booktitle =	{Computational Social Systems and the Internet},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7271},
  editor =	{Peter Cramton and Rudolf M\"{u}ller and Eva Tardos and Moshe Tennenholtz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-11616},
  doi =		{10.4230/DagSemProc.07271.7},
  annote =	{Keywords: Query auctions, ex post equilibrium, efficiency}

Keywords: Query auctions, ex post equilibrium, efficiency
Collection: 07271 - Computational Social Systems and the Internet
Issue Date: 2007
Date of publication: 02.10.2007

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI