Showing cs.GTShow all
3 papers · 1 filter
cs.GT2026
Revisiting the Bertrand Paradox via Equilibrium Analysis of No-regret Learners
Arnab Maiti, Junyan Liu, Kevin Jamieson +1
We study the discrete Bertrand pricing game with a non-increasing demand function. The game has players who simultaneously choose prices from the set $\{1/k, 2/k, \ldots,…
cs.GT2025
Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals
Junyan Liu, Arnab Maiti, Artin Tajdini +2
We initiate the study of a repeated principal-agent problem over a finite horizon , where a principal sequentially interacts with types of agents arriving in an advers…
cs.GT2023
Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game
Arnab Maiti, Ross Boczar, Kevin Jamieson +1
We study the query complexity of finding the set of all Nash equilibria in two-player zero-sum matrix games. Fearnley and Savani (2016) s…