DSpace Repository

Thegeneralized Stackelberg equilibrium of the all-pay auction with complete information

Show simple item record

dc.creator Konrad, Kai A.
dc.creator Leininger, Wolfgang
dc.date 2005
dc.date.accessioned 2013-10-16T07:02:44Z
dc.date.available 2013-10-16T07:02:44Z
dc.date.issued 2013-10-16
dc.identifier http://hdl.handle.net/10419/19073
dc.identifier ppn:509694217
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/10419/19073
dc.description We characterize the equilibrium of the all-pay auction with general convex cost of effort and sequential effort choices. We consider a set of n players who are arbitrarily partitioned into a group of players who choose their efforts ?early? and a group of players who choose ?late?. Only the player with the lowest cost of effort has a positive payoff in any equilibrium. This payoff depends on his own timing vis-a-vis the timing of others. We also show that the choice of timing can be endogenized, in which case the strongest player typically chooses ?late?, whereas all other players are indifferent with respect to their choice of timing. In the most prominent equilibrium the player with the lowest cost of effort wins the auction at zero aggregate cost.
dc.language eng
dc.publisher
dc.relation CESifo working papers 1609
dc.rights http://www.econstor.eu/dspace/Nutzungsbedingungen
dc.subject D74
dc.subject D72
dc.subject ddc:330
dc.subject sequential all-pay auction
dc.subject complete information
dc.subject generalized cost
dc.subject generalized Stackelberg game
dc.subject Auktionstheorie
dc.subject Vollkommene Information
dc.subject Spieltheorie
dc.subject Kosten
dc.subject Theorie
dc.title Thegeneralized Stackelberg equilibrium of the all-pay auction with complete information
dc.type doc-type:workingPaper


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account