IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v53y2024i4d10.1007_s00182-024-00909-z.html
   My bibliography  Save this article

Constructive comparison in bidding combinatorial games

Author

Listed:
  • Prem Kant

    (IIT Bombay)

  • Urban Larsson

    (IIT Bombay)

  • Ravi K. Rai

    (University of Liverpool)

  • Akshay V. Upasany

    (IIT Bombay)

Abstract

Discrete Richman Bidding Combinatorial Games that generalize alternating normal play were introduced by Kant, Larsson, Rai, and Upasany (2024). The major questions concerning defined outcomes were resolved. By generalizing standard techniques from alternating play, Conway (ONAG, 1976), Berlekamp et al. (Winning Ways, 1982) and Siegel (2013), we study an algorithmic play-solution to the problem of game comparison. We demonstrate some consequences of this result that generalize classical alternating play results. In particular, integers, dyadics and defined zugzwangs have many nice properties, such as group structures, but on the other hand a nim heap of size one $$*=\left\{ 0\!\mid \!0\right\} $$ ∗ = 0 ∣ 0 becomes non-invertible in case of non-trivial bidding. Moreover, we state a couple of thrilling conjectures and open problems for readers to dive into this promising path of bidding combinatorial games.

Suggested Citation

  • Prem Kant & Urban Larsson & Ravi K. Rai & Akshay V. Upasany, 2024. "Constructive comparison in bidding combinatorial games," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(4), pages 1223-1248, December.
    • Handle: RePEc:spr:jogath:v:53:y:2024:i:4:d:10.1007_s00182-024-00909-z
    DOI: 10.1007/s00182-024-00909-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00182-024-00909-z
    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-024-00909-z?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.

    More about this item

    Statistics

    Access and download statistics

    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:53:y:2024:i:4:d:10.1007_s00182-024-00909-z. 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: 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.