10 citations · 36 across the 43 of their papers we have counts for
7 papers · 1 filter
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…
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…
Cumulative Games: Who is the current player?
Urban Larsson, Reshef Meir, Yair Zick
Combinatorial Game Theory(CGT)is a branch of Game Theory that has developed largely independently of Economic Game Theory (EGT), and is concerned with deep mathematical properties…
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…
Golden games
Urban Larsson, Yakov Babichenko
We consider extensive form win-lose games over a complete binary-tree of depth where players act in an alternating manner. We study arguably the simplest random structure of pa…
Asymptotically Efficient Multi-Unit Auctions via Posted Prices
Urban Larsson, Ron Lavi
We study the asymptotic average-case efficiency of static and anonymous posted prices for agents and multiple identical items with .…