Efficiency levels in sequential auctions with dynamic arrivals

Ron Lavi, Ella Segev

Research output: Contribution to journalArticlepeer-review

Abstract

In an environment with dynamic arrivals of players who wish to purchase only one of multiple identical objects for which they have a private value, we analyze a sequential auction mechanism with an activity rule. If the players play undominated strategies then we are able to bound the efficiency loss compared to an optimal mechanism that maximizes the total welfare. We have no assumptions on the underlying distribution from which the players’ arrival times and valuations for the object are drawn. Moreover we have no assumption of a common prior on this distribution.

Original languageEnglish
Pages (from-to)791-819
Number of pages29
JournalInternational Journal of Game Theory
Volume43
Issue number4
DOIs
StatePublished - 1 Nov 2014

Keywords

  • Dynamic arrivals
  • Sequential ascending auctions
  • Undominated strategies

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Mathematics (miscellaneous)
  • Social Sciences (miscellaneous)
  • Economics and Econometrics
  • Statistics, Probability and Uncertainty

Fingerprint

Dive into the research topics of 'Efficiency levels in sequential auctions with dynamic arrivals'. Together they form a unique fingerprint.

Cite this