2,672 research outputs found
Joint strategy fictitious play with inertia for potential games
We consider multi-player repeated games involving a large number of players with large strategy spaces and enmeshed utility structures. In these ldquolarge-scalerdquo games, players are inherently faced with limitations in both their observational and computational capabilities. Accordingly, players in large-scale games need to make their decisions using algorithms that accommodate limitations in information gathering and processing. This disqualifies some of the well known decision making models such as ldquoFictitious Playrdquo (FP), in which each player must monitor the individual actions of every other player and must optimize over a high dimensional probability space. We will show that Joint Strategy Fictitious Play (JSFP), a close variant of FP, alleviates both the informational and computational burden of FP. Furthermore, we introduce JSFP with inertia, i.e., a probabilistic reluctance to change strategies, and establish the convergence to a pure Nash equilibrium in all generalized ordinal potential games in both cases of averaged or exponentially discounted historical data. We illustrate JSFP with inertia on the specific class of congestion games, a subset of generalized ordinal potential games. In particular, we illustrate the main results on a distributed traffic routing problem and derive tolling procedures that can lead to optimized total traffic congestion
The minority game: An economics perspective
This paper gives a critical account of the minority game literature. The
minority game is a simple congestion game: players need to choose between two
options, and those who have selected the option chosen by the minority win. The
learning model proposed in this literature seems to differ markedly from the
learning models commonly used in economics. We relate the learning model from
the minority game literature to standard game-theoretic learning models, and
show that in fact it shares many features with these models. However, the
predictions of the learning model differ considerably from the predictions of
most other learning models. We discuss the main predictions of the learning
model proposed in the minority game literature, and compare these to
experimental findings on congestion games.Comment: 30 pages, 4 figure
Congestion, equilibrium and learning: The minority game
The minority game is a simple congestion game in which the players' main goal
is to choose among two options the one that is adopted by the smallest number
of players. We characterize the set of Nash equilibria and the limiting
behavior of several well-known learning processes in the minority game with an
arbitrary odd number of players. Interestingly, different learning processes
provide considerably different predictions
Payoff-Based Dynamics for Multiplayer Weakly Acyclic Games
We consider repeated multiplayer games in which players repeatedly and simultaneously choose strategies from a finite set of available strategies according to some strategy adjustment process. We focus on the specific class of weakly acyclic games, which is particularly relevant for multiagent cooperative control problems. A strategy adjustment process determines how players select their strategies at any stage as a function of the information gathered over previous stages. Of particular interest are “payoff-based” processes in which, at any stage, players know only their own actions and (noise corrupted) payoffs from previous stages. In particular, players do not know the actions taken by other players and do not know the structural form of payoff functions. We introduce three different payoff-based processes for increasingly general scenarios and prove that, after a sufficiently large number of stages, player actions constitute a Nash equilibrium at any stage with arbitrarily high probability. We also show how to modify player utility functions through tolls and incentives in so-called congestion games, a special class of weakly acyclic games, to guarantee that a centralized objective can be realized as a Nash equilibrium. We illustrate the methods with a simulation of distributed routing over a network
The Minority Game: An Economics Perspective
This paper gives a critical account of the minority game literature. The minority game is a simple congestion game: players need to choose between two options, and those who have selected the option chosen by the minority win. The learning model proposed in this literature seems to differ markedly from the learning models commonly used in economics. We relate the learning model from the minority game literature to standard game-theoretic learning models, and show that in fact it shares many features with these models. However, the predictions of the learning model differ considerably from the predictions of most other learning models. We discuss the main predictions of the learning model proposed in the minority game literature, and compare these to experimental findings on congestion games.Learning;congestion games;experiments.
The El Farol Bar Problem Revisited: Reinforcement Learning in a Potential Game
We revisit the El Farol bar problem developed by Brian W. Arthur (1994) to investigate how one might best model bounded rationality in economics. We begin by modelling the El Farol bar problem as a market entry game and describing its Nash equilibria. Then, assuming agents are boundedly rational in accordance with a reinforcement learning model, we analyse long-run behaviour in the repeated game. We then state our main result. In a single population of individuals playing the El Farol game, learning theory predicts that the population is eventually subdivided into two distinct groups: those who invariably go to the bar and those who almost never do. In doing so we demonstrate that learning theory predicts sorting in the El Farol bar problem.
- …