1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.GT2022★ 1 cited
Constructive comparison in bidding combinatorial games
Prem Kant, Urban Larsson, Ravi K. Rai +1
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 opt…
cs.GT2022
Bidding combinatorial games
Prem Kant, Urban Larsson, Ravi K. Rai +1
Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention…
cs.GT2020★ 1 cited
Discrete Richman-bidding Scoring Games
Urban Larsson, Neel Patel, Ravi Kant Rai
We study zero-sum (combinatorial) games, within the framework of so-called Richman auctions (Lazarus et al. 1996) namely, we modify the alternating play scoring ruleset Cumulative…