Constructive comparison in bidding combinatorial games
From MaRDI portal
Publication:6405834
arXiv2207.11596MaRDI QIDQ6405834FDOQ6405834
Authors: Prem Kant, Urban Larsson, Ravi Kant Rai, Akshay V. Upasany 
Publication date: 23 July 2022
Abstract: A class of discrete Bidding Combinatorial Games that generalize alternating normal play was introduced by Kant, Larsson, Rai, and Upasany (2022). The major questions concerning optimal outcomes were resolved. By generalizing standard game comparison techniques from alternating normal play, we propose an algorithmic play-solution to the problem of game comparison for a class of bidding games that include game forms that are defined numbers. We demonstrate a number of consequences of this result that, in some cases, generalize the classical results in alternating play (from Winning Ways and On Numbers and Games). We state a couple of thrilling conjectures and open problems for readers to dive into this promising path of bidding combinatorial games.
This page was built for publication: Constructive comparison in bidding combinatorial games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6405834)
