arXiv Analytics

Sign in

arXiv:2311.15048 [math.OC]AbstractReferencesReviewsResources

Guessing a Random Function and Repeated Games in Continuous Time

Catherine Rainer, Eilon Solan

Published 2023-11-25Version 1

We study a game where one player selects a random function, and the other has to guess that function, and show that with high probability the second player can correctly guess most of the random function. We apply this analysis to continuous-time repeated games played with mixed strategies with delay, identify good responses of a player to any profile of her opponents, and show that the minmax value coincides with the minmax value in pure strategies of the one-shot game.

Related articles: Most relevant | Search more
arXiv:2205.01774 [math.OC] (Published 2022-05-03)
Efficient Algorithms for Minimizing Compositions of Convex Functions and Random Functions and Its Applications in Network Revenue Management
arXiv:1508.03921 [math.OC] (Published 2015-08-17)
Non-zero-sum stopping games in continuous time
arXiv:math/0306279 [math.OC] (Published 2003-06-19)
Stopping games in continuous time