IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i8p825-d533525.html
   My bibliography  Save this article

Robust Pairwise n -Person Stochastic Duel Game

Author

Listed:
  • Song-Kyoo (Amang) Kim

    (Macao Polytechnic Institute, School of Applied Sciences, R. de Luis Gonzaga Gomes, Macao)

Abstract

This paper introduces an extended version of a stochastic game under the antagonistic duel-type setup. The most flexible multiple person duel game is analytically solved. Moreover, the explicit formulas are solved to determine the time-dependent duel game model using the first exceed theory in multiple game stages. Unlike conventional stochastic duel games, multiple battlefields are firstly introduced and each battlefield becomes a shooting ground of pairwise players in a multiperson game. Each player selects different targets in different game stages. An analogue of this new theory was designed to find the best shooting time within multiple battlefields. This model is fully mathematically explained and is the basis with which to apply a stochastic duel-type game in various practical applications.

Suggested Citation

  • Song-Kyoo (Amang) Kim, 2021. "Robust Pairwise n -Person Stochastic Duel Game," Mathematics, MDPI, vol. 9(8), pages 1-11, April.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:8:p:825-:d:533525
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/8/825/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/8/825/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Schwalbe, Ulrich & Walker, Paul, 2001. "Zermelo and the Early History of Game Theory," Games and Economic Behavior, Elsevier, vol. 34(1), pages 123-137, January.
    2. Moschini, GianCarlo, 2004. "Nash equilibrium in strictly competitive games: live play in soccer," Economics Letters, Elsevier, vol. 85(3), pages 365-371, December.
    3. Christopher G. Kingston & Robert E. Wright, 2010. "The Deadliest of Games: The Institution of Dueling," Southern Economic Journal, John Wiley & Sons, vol. 76(4), pages 1094-1106, April.
    Full references (including those not matched with items on IDEAS)

    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. Song-Kyoo (Amang) Kim, 2020. "A Versatile Stochastic Duel Game," Mathematics, MDPI, vol. 8(5), pages 1-13, May.
    2. Ewerhart, Christian, 2002. "Backward Induction and the Game-Theoretic Analysis of Chess," Games and Economic Behavior, Elsevier, vol. 39(2), pages 206-214, May.
    3. Sabrina Evans & Paolo Turrini, 2023. "Improving Strategic Decisions in Sequential Games by Exploiting Positional Similarity," Games, MDPI, vol. 14(3), pages 1-13, April.
    4. Luigi Buzzacchi & Stefano Pedrini, 2014. "Does player specialization predict player actions? Evidence from penalty kicks at FIFA World Cup and UEFA Euro Cup," Applied Economics, Taylor & Francis Journals, vol. 46(10), pages 1067-1080, April.
    5. Gelade Garry, 2014. "Evaluating the ability of goalkeepers in English Premier League football," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 10(2), pages 279-286, June.
    6. Casilda Lasso de la Vega & Oscar Volij, 2020. "The value of a draw," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(4), pages 1023-1044, November.
    7. Wolfgang Leininger & Axel Ockenfels, 2007. "The Penalty-Duel and Institutional Design: Is there a Neeskens-Effect?," Working Paper Series in Economics 34, University of Cologne, Department of Economics.
    8. Christine Horne & Heiko Rauhut, 2013. "Using laboratory experiments to study law and crime," Quality & Quantity: International Journal of Methodology, Springer, vol. 47(3), pages 1639-1655, April.
    9. Marek Mikolaj Kaminski, 2019. "Generalized Backward Induction: Justification for a Folk Algorithm," Games, MDPI, vol. 10(3), pages 1-25, August.
    10. Holler Manfred J., 2002. "Classical, Modern, and New Game Theory / Klassische, Moderne und Neue Spieltheorie," Journal of Economics and Statistics (Jahrbuecher fuer Nationaloekonomie und Statistik), De Gruyter, vol. 222(5), pages 556-583, October.
    11. Thomas Böhme & Frank Göring & Zsolt Tuza & Herwig Unger, 2009. "Learning of winning strategies for terminal games with linear-size memory," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(2), pages 155-168, June.
    12. Matros, Alexander, 2018. "Lloyd Shapley and chess with imperfect information," Games and Economic Behavior, Elsevier, vol. 108(C), pages 600-613.
    13. Ofer Azar & Michael Bar-Eli, 2011. "Do soccer players play the mixed-strategy Nash equilibrium?," Applied Economics, Taylor & Francis Journals, vol. 43(25), pages 3591-3601.
    14. Anthony Strittmatter & Uwe Sunde & Dainis Zegners, 2020. "Life cycle patterns of cognitive performance over the long run," Proceedings of the National Academy of Sciences, Proceedings of the National Academy of Sciences, vol. 117(44), pages 27255-27261, November.
    15. Dainis Zegners & Uwe Sunde & Anthony Strittmatter, 2020. "Decisions and Performance Under Bounded Rationality: A Computational Benchmarking Approach," CESifo Working Paper Series 8341, CESifo.
    16. Liu, Chanjuan & Zhu, Enqiang, 2017. "Computational ability in games: Individual difference and dynamics," Applied Mathematics and Computation, Elsevier, vol. 313(C), pages 313-320.
    17. Peter Backus & Maria Cubel & Matej Guid & Santiago Sanchez-Pages & Enrique Lopez Manas, 2016. "Gender, Competition and Performance: Evidence from Real Tournaments," Economics Discussion Paper Series 1605, Economics, The University of Manchester.
    18. McKinney, C. Nicholas & Van Huyck, John B., 2013. "Eureka Learning: Heuristics and response time in perfect information games," Games and Economic Behavior, Elsevier, vol. 79(C), pages 223-232.
    19. Hélène Le Cadre, 2019. "On the efficiency of local electricity markets under decentralized and centralized designs: a multi-leader Stackelberg game analysis," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(4), pages 953-984, December.
    20. Ignacio García-Marco & Kolja Knauer & Luis Pedro Montejano, 2021. "Chomp on generalized Kneser graphs and others," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(3), pages 603-621, September.

    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:gam:jmathe:v:9:y:2021:i:8:p:825-:d:533525. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.