Auction in Impartial Games
Ravi Kant Rai
Ravi Kant Rai, Department of Computer Science, University of Liverpool, United Kingdom.
Manuscript received on 07 March 2024 | Revised Manuscript received on 13 March 2024 | Manuscript Accepted on 15 March 2024 | Manuscript published on 30 March 2024 | PP: 1-3 | Volume-10 Issue-7, March 2024 | Retrieval Number: 100.1/ijbsac.H051110080424 | DOI: 10.35940/ijbsac.H0511.10070324
Open Access | Editorial and Publishing Policies | Cite | Zenodo | OJS | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Combinatorial game theory (CGT) is a branch of mathematics and theoretical computer science that typically studies sequential games with perfect information. We prove an importance of a tiebreaking marker related with N-position and P-position in the bidding variant of Impartial combinatorial games.
Keywords: Bidding games; Richman; Combinatorial games. 2020 Mathematics Subject Classification: 68R05, 91A05, 91A46, 91B26
Scope of the Article: Game Theory