IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v109y2023ics0304406823001040.html
   My bibliography  Save this article

Two-stage elimination games

Author

Listed:
  • Sela, Aner

Abstract

We study two-stage elimination games with four heterogeneous players. In the first stage, the players are allocated into two contests, each of which includes two players competing against each other in an all-pay auction. The winners of the two contests then interact with each other in the second stage. The outcomes of the interaction in the second stage are given by a general form of the players’ payoffs as functions of their types (abilities). Then, we examine the effect of the timing of the competitions in the first stage on the players’ expected payoffs and their total effort. In particular, we show that if the players’ payoff functions in the second stage are separable in the players’ types, then the timing of play in the first stage of either simultaneous or sequential contests has no effect on the players’ expected payoff as well as their total effort in the elimination games.

Suggested Citation

  • Sela, Aner, 2023. "Two-stage elimination games," Journal of Mathematical Economics, Elsevier, vol. 109(C).
  • Handle: RePEc:eee:mateco:v:109:y:2023:i:c:s0304406823001040
    DOI: 10.1016/j.jmateco.2023.102911
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406823001040
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.jmateco.2023.102911?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:109:y:2023:i:c:s0304406823001040. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.