2 citations · 5 across the 12 of their papers we have counts for
4 papers · 1 filter
Learning to Play Against Unknown Opponents
Eshwar Ram Arunachaleswaran, Natalie Collina, Jon Schneider
We consider the problem of a learning agent who has to repeatedly play a general sum game against a strategic opponent who acts to maximize their own payoff by optimally responding…
Algorithmic Collusion Without Threats
Eshwar Ram Arunachaleswaran, Natalie Collina, Sampath Kannan +2
There has been substantial recent concern that pricing algorithms might learn to ``collude.'' Supra-competitive prices can emerge as a Nash equilibrium of repeated pricing games, i…
Pareto-Optimal Algorithms for Learning in Games
Eshwar Ram Arunachaleswaran, Natalie Collina, Jon Schneider
We study the problem of characterizing optimal learning algorithms for playing repeated games against an adversary with unknown payoffs. In this problem, the first player (called t…
An Elementary Predictor Obtaining Distance to Calibration
Eshwar Ram Arunachaleswaran, Natalie Collina, Aaron Roth +1
Blasiok et al. [2023] proposed distance to calibration as a natural measure of calibration error that unlike expected calibration error (ECE) is continuous. Recently, Qiao and Zhen…