no code implementations • 19 Mar 2024 • Mario Bravo, Juan Pablo Contreras
We analyze the oracle complexity of the stochastic Halpern iteration with variance reduction, where we aim to approximate fixed-points of nonexpansive and contractive operators in a normed finite-dimensional space.
no code implementations • NeurIPS 2018 • Mario Bravo, David Leslie, Panayotis Mertikopoulos
This paper examines the long-run behavior of learning with bandit feedback in non-cooperative concave games.
no code implementations • 3 Oct 2018 • Mario Bravo, David S. Leslie, Panayotis Mertikopoulos
This paper examines the long-run behavior of learning with bandit feedback in non-cooperative concave games.
no code implementations • 20 Dec 2014 • Mario Bravo, Panayotis Mertikopoulos
Motivated by the scarcity of accurate payoff feedback in practical applications of game theory, we examine a class of learning dynamics where players adjust their choices based on past payoff observations that are subject to noise and random disturbances.
no code implementations • 12 Jun 2013 • Mario Bravo, Mathieu Faure
Consider a 2-player normal-form game repeated over time.