English
Related papers

Related papers: Repeated Coordination with Private Learning

200 papers

We study discounted infinitely repeated games in which players agree on a cooperative mixed action profile but, at each step, observe only the realized pure actions. This form of imperfect monitoring breaks classical trigger strategies,…

Applications · Statistics 2026-03-09 Aymeric Capitaine , Antoine Scheid , Etienne Boursier , Alain Durmus , Michael I. Jordan

Gameplay under various forms of uncertainty has been widely studied. Feldman et al. (2010) studied a particularly low-information setting in which one observes the opponent's actions but no payoffs, not even one's own, and introduced an…

Computer Science and Game Theory · Computer Science 2024-04-02 Avrim Blum , Melissa Dutz

We consider the problem of learning stable matchings with unknown preferences in a decentralized and uncoordinated manner, where "decentralized" means that players make decisions individually without the influence of a central platform, and…

Computer Science and Game Theory · Computer Science 2024-08-16 S. Rasoul Etesami , R. Srikant

We prove that in a general zero-sum repeated game where the first player is more informed than the second player and controls the evolution of information on the state, the uniform value exists. This result extends previous results on…

Optimization and Control · Mathematics 2013-01-10 Fabien Gensbittel , Miquel Oliu-Barton , Xavier Venel

We study the role of costly information in non-cooperative two-player games when an extrinsic third party information broker is introduced asymmetrically, allowing one player to obtain information about the other player's action. This…

Computer Science and Game Theory · Computer Science 2020-02-20 Matthew J. Young , Andrew Belmonte

We consider a broad class of stochastic imitation dynamics over networks, encompassing several well known learning models such as the replicator dynamics. In the considered models, players have no global information about the game…

Systems and Control · Computer Science 2021-03-02 Lorenzo Zino , Giacomo Como , Fabio Fagnani

We introduce and study an evolutionary complementarity game where in each round a player of population 1 is paired with a member of population 2. The game is symmetric, and each player tries to obtain an advantageous deal, but when one of…

Adaptation and Self-Organizing Systems · Physics 2015-06-26 Juergen Jost , Wei Li

This paper investigates a class of multi-player discrete games where each player aims to maximize its own utility function. Each player does not know the other players' action sets, their deployed actions or the structures of its own or the…

Optimization and Control · Mathematics 2017-12-05 Zhisheng Hu , Minghui Zhu , Ping Chen , Peng Liu

We use the indirect evolutionary approach to study evolutionarily stable preferences against multiple mutations in single- and multi-population matching settings, respectively. Players choose strategies to maximize their subjective…

Computer Science and Game Theory · Computer Science 2025-07-08 Yu-Sung Tu , Wei-Torng Juang

Long-term cooperation, competition, or exploitation among individuals can be modeled through repeated games. In repeated games, Press and Dyson discovered zero-determinant (ZD) strategies that enforce a special relationship between two…

Computer Science and Game Theory · Computer Science 2022-07-18 Daiki Miyagawa , Azumi Mamiya , Genki Ichinose

We study graphs and two-player games in which rewards are assigned to states, and the goal of the players is to satisfy or dissatisfy certain property of the generated outcome, given as a mean payoff property. Since the notion of…

Logic in Computer Science · Computer Science 2016-04-22 Tomáš Brázdil , Vojtěch Forejt , Antonín Kučera , Petr Novotný

In games with a large number of players where players may have overlapping objectives, the analysis of stable outcomes typically depends on player types. A special case is when a large part of the player population consists of imitation…

Computer Science and Game Theory · Computer Science 2010-06-18 Soumya Paul , R. Ramanujam

This paper studies a nonzero-sum Dynkin game in discrete time under non-exponential discounting. For both players, there are two levels of game-theoretic reasoning intertwined. First, each player looks for an intra-personal equilibrium…

Optimization and Control · Mathematics 2022-05-09 Yu-Jui Huang , Zhou Zhou

We study the existence of different notions of value in two-person zero-sum repeated games where the state evolves and players receive signals. We provide some examples showing that the limsup value (and the uniform value) may not exist in…

Optimization and Control · Mathematics 2016-01-08 Hugo Gimbert , Jérôme Renault , Sylvain Sorin , Xavier Venel , Wiesław Zielonka

We study the problem of imitation learning from demonstrations of multiple coordinating agents. One key challenge in this setting is that learning a good model of coordination can be difficult, since coordination is often implicit in the…

Machine Learning · Computer Science 2018-05-28 Hoang M. Le , Yisong Yue , Peter Carr , Patrick Lucey

When people play a repeated game they usually try to anticipate their opponents' moves based on past observations, and then decide what action to take next. Behavioural economics studies the mechanisms by which strategic decisions are taken…

Physics and Society · Physics 2012-04-20 Tobias Galla

We study a simple adaptive model in the framework of an N -player normal form game. The model consists of a repeated game where the players only know their own action space and their own payoff scored at each stage, not those of the other…

Computer Science and Game Theory · Computer Science 2017-06-12 Mario Bravo

We study the interpersonal trust of a population of agents, asking whether chance may decide if a population ends up in a high trust or low trust state. We model this by a discrete time, random matching stochastic coordination game. Agents…

Physics and Society · Physics 2024-05-20 Benedikt V. Meylahn , Arnoud V. den Boer , Michel Mandjes

We consider a finite horizon repeated game with $N$ selfish players who observe their types privately and take actions, which are publicly observed. Their actions and types jointly determine their instantaneous rewards. In each period,…

Computer Science and Game Theory · Computer Science 2019-05-17 Deepanshu Vasal

The behaviour of multi-agent learning in many player games has been shown to display complex dynamics outside of restrictive examples such as network zero-sum games. In addition, it has been shown that convergent behaviour is less likely to…

Computer Science and Game Theory · Computer Science 2023-07-27 Aamal Hussain , Dan Leonte , Francesco Belardinelli , Georgios Piliouras