IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v50y2021i3d10.1007_s00182-019-00697-x.html
   My bibliography  Save this article

Chomp on generalized Kneser graphs and others

Author

Listed:
  • Ignacio García-Marco

    (Universidad de La Laguna)

  • Kolja Knauer

    (Université de Toulon, CNRS, LIS)

  • Luis Pedro Montejano

    (CONACYT Research Fellow—Centro de Investigación en Matemáticas)

Abstract

In Chomp on graphs, two players alternatingly pick an edge or a vertex from a graph. The player that cannot move any more loses. The questions one wants to answer for a given graph are: Which player has a winning strategy? Can an explicit strategy be devised? We answer these questions (and determine the Nim-value) for the class of generalized Kneser graphs and for several families of Johnson graphs. We also generalize some of these results to the clique complexes of these graphs. Furthermore, we determine which player has a winning strategy for some classes of threshold graphs.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jogath:v:50:y:2021:i:3:d:10.1007_s00182-019-00697-x
    DOI: 10.1007/s00182-019-00697-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00182-019-00697-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00182-019-00697-x?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.

    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.
    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. Ewerhart, Christian, 2002. "Backward Induction and the Game-Theoretic Analysis of Chess," Games and Economic Behavior, Elsevier, vol. 39(2), pages 206-214, May.
    2. Song-Kyoo (Amang) Kim, 2020. "A Versatile Stochastic Duel Game," Mathematics, MDPI, vol. 8(5), pages 1-13, 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. 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.
    5. Song-Kyoo (Amang) Kim, 2021. "Robust Pairwise n -Person Stochastic Duel Game," Mathematics, MDPI, vol. 9(8), pages 1-11, April.
    6. Marek Mikolaj Kaminski, 2019. "Generalized Backward Induction: Justification for a Folk Algorithm," Games, MDPI, vol. 10(3), pages 1-25, August.
    7. 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.
    8. 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.
    9. Matros, Alexander, 2018. "Lloyd Shapley and chess with imperfect information," Games and Economic Behavior, Elsevier, vol. 108(C), pages 600-613.
    10. 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.
    11. Dainis Zegners & Uwe Sunde & Anthony Strittmatter, 2020. "Decisions and Performance Under Bounded Rationality: A Computational Benchmarking Approach," CESifo Working Paper Series 8341, CESifo.
    12. Liu, Chanjuan & Zhu, Enqiang, 2017. "Computational ability in games: Individual difference and dynamics," Applied Mathematics and Computation, Elsevier, vol. 313(C), pages 313-320.
    13. 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.
    14. 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.
    15. 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.
    16. Rabah Amir & Igor Evstigneev & Klaus Schenk-Hoppé, 2013. "Asset market games of survival: a synthesis of evolutionary and dynamic games," Annals of Finance, Springer, vol. 9(2), pages 121-144, May.
    17. Song-Kyoo (Amang) Kim, 2020. "Antagonistic One-To-N Stochastic Duel Game," Mathematics, MDPI, vol. 8(7), pages 1-12, July.
    18. Fei Yu & Yanrui Wu & Jin Chen & Arie Y. Lewin, 2023. "Technological leapfrogging and country strategic patent policy," Journal of International Business Studies, Palgrave Macmillan;Academy of International Business, vol. 54(5), pages 887-909, July.
    19. Chaitanya Gokhale & Arne Traulsen, 2014. "Evolutionary Multiplayer Games," Dynamic Games and Applications, Springer, vol. 4(4), pages 468-488, December.
    20. Boros, E. & Gurvich, V., 2003. "On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 207-241, October.

    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:spr:jogath:v:50:y:2021:i:3:d:10.1007_s00182-019-00697-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.