All Rights Reserved
AccessEcon LLC 2006, 2008.
Powered by MinhViet JSC
ralph lauren polo

Katerina Sherstyuk
''Complexity and bidder behavior in iterative auctions''
( 2011, Vol. 31 No.4 )
We extend the finite automata approach to evaluate complexity of strategies in iterative adjustment processes such as auctions. Intuitively, a strategy's complexity is equal to the number of different contingencies in which qualitatively different behaviors are prescribed. Complexity may explain bidder choice of strategies in multi-unit iterative auctions.
Keywords: ascending auctions; complexity; finite automata; experimental evidence
JEL: C0 - Mathematical and Quantitative Methods: General
C7 - Game Theory and Bargaining Theory:General
Manuscript Received : Jan 19 2011 Manuscript Accepted : Oct 05 2011

  This abstract has been downloaded 282 times                The Full PDF of this paper has been downloaded 87745 times