Advanced Search
MyIDEAS: Login

Gambling in Contests with Random Initial Law

Contents:

Author Info

  • Han Feng
  • David Hobson
Registered author(s):

    Abstract

    This paper studies a variant of the contest model introduced by Seel and Strack. In the Seel-Strack contest, each agent or contestant privately observes a Brownian motion, absorbed at zero, and chooses when to stop it. The winner of the contest is the contestant who stops at the highest value. The model assumes that all the processes start from a common value $x_0>0$ and the symmetric Nash equilibrium is for each agent to utilise a stopping rule which yields a randomised value for the stopped process. In the two-player contest this randomised value should have a uniform distribution on $[0,2x_0]$. In this paper we consider a variant of the problem whereby the starting values of the Brownian motions are independent, non-negative, random variables that have a common law $\mu$. We consider a two-player contest and prove the existence and uniqueness of a symmetric Nash equilibrium for the problem. The solution is that each agent should aim for the target law $\nu$, where $\nu$ is greater than or equal to $\mu$ in convex order; $\nu$ has an atom at zero of the same size as any atom of $\mu$ at zero, and otherwise is atom free; on $(0,\infty)$ $\nu$ has a decreasing density; and the density of $\nu$ only decreases at points where the convex order constraint is binding.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://arxiv.org/pdf/1405.7801
    File Function: Latest version
    Download Restriction: no

    Bibliographic Info

    Paper provided by arXiv.org in its series Papers with number 1405.7801.

    as in new window
    Length:
    Date of creation: May 2014
    Date of revision:
    Handle: RePEc:arx:papers:1405.7801

    Contact details of provider:
    Web page: http://arxiv.org/

    Related research

    Keywords:

    This paper has been announced in the following NEP Reports:

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Seel, Christian & Strack, Philipp, 2013. "Gambling in contests," Journal of Economic Theory, Elsevier, vol. 148(5), pages 2033-2048.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:arx:papers:1405.7801. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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