IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v77y2007i17p1683-1689.html
   My bibliography  Save this article

A game version of the Cowan-Zabczyk-Bruss' problem

Author

Listed:
  • Szajowski, Krzysztof

Abstract

The paper deals with the continuous-time two person non-zero sum game extension of the no information secretary problem. The objects appear according to the compound Poisson process and each player can choose only one applicant. If both players would like to select the same one, then the priority is assigned randomly. The aim of the players is to choose the best candidate. A construction of Nash equilibria for such game is presented. The extension of the game with randomized stopping times is taken into account. The Nash values for such extension are obtained. Analysis of the solutions for different priority defining lotteries is given.

Suggested Citation

  • Szajowski, Krzysztof, 2007. "A game version of the Cowan-Zabczyk-Bruss' problem," Statistics & Probability Letters, Elsevier, vol. 77(17), pages 1683-1689, November.
    • Handle: RePEc:eee:stapro:v:77:y:2007:i:17:p:1683-1689
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(07)00152-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. Nowak, Andrzej S. & Szajowski, Krzysztof, 1998. "Nonzero-sum Stochastic Games," MPRA Paper 19995, University Library of Munich, Germany, revised 1999.
    2. Yasuda, M., 1985. "On a randomized strategy in Neveu's stopping problem," Stochastic Processes and their Applications, Elsevier, vol. 21(1), pages 159-166, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. F. Thomas Bruss, 2021. "Combined Games with Randomly Delayed Beginnings," Mathematics, MDPI, vol. 9(5), pages 1-16, March.
    2. L. Bayón & P. Fortuny & J. Grau & A. M. Oller-Marcén & M. M. Ruiz, 2019. "The Best-or-Worst and the Postdoc problems with random number of candidates," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 86-110, July.
    3. Krasnosielska, Anna, 2009. "A version of the Elfving problem with random starting time," Statistics & Probability Letters, Elsevier, vol. 79(23), pages 2429-2436, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ramsey, David M. & Szajowski, Krzysztof, 2008. "Selection of a correlated equilibrium in Markov stopping games," European Journal of Operational Research, Elsevier, vol. 184(1), pages 185-206, January.
    2. Anna Jaśkiewicz & Andrzej Nowak, 2011. "Stochastic Games with Unbounded Payoffs: Applications to Robust Control in Economics," Dynamic Games and Applications, Springer, vol. 1(2), pages 253-279, June.
    3. Saghafian, Soroush, 2018. "Ambiguous partially observable Markov decision processes: Structural results and applications," Journal of Economic Theory, Elsevier, vol. 178(C), pages 1-35.
    4. Garud N. Iyengar, 2005. "Robust Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 30(2), pages 257-280, May.
    5. Gong, Rui & Page, Frank & Wooders, Myrna, 2015. "Endogenous correlated network dynamics," LSE Research Online Documents on Economics 65098, London School of Economics and Political Science, LSE Library.
    6. Sandroni, Alvaro & Urgun, Can, 2017. "Dynamics in Art of War," Mathematical Social Sciences, Elsevier, vol. 86(C), pages 51-58.
    7. Łukasz Balbus & Kevin Reffett & Łukasz Woźny, 2013. "Markov Stationary Equilibria in Stochastic Supermodular Games with Imperfect Private and Public Information," Dynamic Games and Applications, Springer, vol. 3(2), pages 187-206, June.
    8. Shmaya, Eran & Solan, Eilon, 2004. "Zero-sum dynamic games and a stochastic variation of Ramsey's theorem," Stochastic Processes and their Applications, Elsevier, vol. 112(2), pages 319-329, August.
    9. P. Herings & Ronald Peeters, 2010. "Homotopy methods to compute equilibria in game theory," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 119-156, January.
    10. Page Jr., F.H., 1994. "Optimal Auction Design with Risk Aversion and Correlated Information," Other publications TiSEM ac23fdfa-b35c-4015-9c5c-e, Tilburg University, School of Economics and Management.
    11. Dang, Chuangyin & Herings, P. Jean-Jacques & Li, Peixuan, 2020. "An Interior-Point Path-Following Method to Compute Stationary Equilibria in Stochastic Games," Research Memorandum 001, Maastricht University, Graduate School of Business and Economics (GSBE).
    12. Nie, Tianyang & Rutkowski, Marek, 2014. "Multi-player stopping games with redistribution of payoffs and BSDEs with oblique reflection," Stochastic Processes and their Applications, Elsevier, vol. 124(8), pages 2672-2698.
    13. Janusz Matkowski & Andrzej Nowak, 2011. "On discounted dynamic programming with unbounded returns," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 46(3), pages 455-474, April.
    14. Said Hamadène & Mohammed Hassani, 2014. "The multi-player nonzero-sum Dynkin game in discrete time," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 79(2), pages 179-194, April.
    15. Elżbieta Ferenstein, 2007. "Randomized stopping games and Markov market games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(3), pages 531-544, December.
    16. Page Jr., Frank H., 1998. "Existence of optimal auctions in general environments," Journal of Mathematical Economics, Elsevier, vol. 29(4), pages 389-418, May.
    17. Tiziano De Angelis & Erik Ekstrom, 2019. "Playing with ghosts in a Dynkin game," Papers 1905.06564, arXiv.org.
    18. Anna Krasnosielska-Kobos, 2016. "Construction of Nash equilibrium based on multiple stopping problem in multi-person game," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(1), pages 53-70, February.
    19. Page, Frank, 2016. "Stationary Markov equilibria for approximable discounted stochastic games," LSE Research Online Documents on Economics 67808, London School of Economics and Political Science, LSE Library.
    20. Eilon Solan & Nicolas Vieille, 2000. "Uniform Value in Recursive Games," Discussion Papers 1293, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

    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:stapro:v:77:y:2007:i:17:p:1683-1689. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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/wps/find/journaldescription.cws_home/622892/description#description .

    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.