相关论文: Extensive Games with Possibly Unaware Players

Graphon games are a class of games with a continuum of agents, introduced to approximate the strategic interactions in large network games. The first result of this study is an equilibrium existence theorem in graphon games, under the same…

Learning in games provides a powerful framework to design control policies for self-interested agents that may be coupled through their dynamics, costs, or constraints. We consider the case where the dynamics of the coupled system can be…

In coalitional games, traditional coalitional game theory does not apply if different participants hold different opinions about the payoff function that corresponds to each subset of the coalition. In this paper, we propose a framework in…

A fundamental problem with the Nash equilibrium concept is the existence of certain "structurally deficient" equilibria that (i) lack fundamental robustness properties, and (ii) are difficult to analyze. The notion of a "regular" Nash…

Network games provide a powerful framework for modeling agent interactions in networked systems, where players are represented by nodes in a graph and their payoffs depend on the actions taken by their neighbors. Extending the framework of…

How do large-scale participants in parimutuel wagering events affect the house and ordinary bettors? A standard narrative suggests that they may temporarily benefit the former at the expense of the latter. To approach this problem, we begin…

In many real-world settings agents engage in strategic interactions with multiple opposing agents who can employ a wide variety of strategies. The standard approach for designing agents for such settings is to compute or approximate a…

This work considers stochastic differential games with a large number of players, whose costs and dynamics interact through the empirical distribution of both their states and their controls. We develop a new framework to prove convergence…

The assumptions of necessary rationality and necessary knowledge of strategies, also known as perfect prediction, lead to at most one surviving outcome, immune to the knowledge that the players have of them. Solutions concepts implementing…

We consider a 3-player game in the normal form, in which each player has two actions. We assume that the game is symmetric and repeated infinitely many times. At each stage players make their choices knowing only the average payoffs from…

We study the structure of the underlying network of connections in the Minority Game. There is not an explicit interaction among the agents, but they interact via global magnitudes of the model and mainly through their strategies. We define…

Game theory has by now found numerous applications in various fields, including economics, industry, jurisprudence, and artificial intelligence, where each player only cares about its own interest in a noncooperative or cooperative manner,…

Supermodular games find significant applications in a variety of models, especially in operations research and economic applications of noncooperative game theory, and feature pure strategy Nash equilibria characterized as fixed points of…

We provide a game-theoretic analysis of consensus, assuming that processes are controlled by rational agents and may fail by crashing. We consider agents that \emph{care only about consensus}: that is, (a) an agent's utility depends only on…

We give elementary examples within a framework for studying decisions under uncertainty where probabilities are only roughly known. The framework, in gambling terms, is that the size of a bet is proportional to the gambler's perceived…

In this paper, a gentle introduction to Game Theory is presented in the form of basic concepts and examples. Minimax and Nash's theorem are introduced as the formal definitions for optimal strategies and equilibria in zero-sum and…

In this paper we focus on noncooperative games with uncertain constraints coupling the agents' decisions. We consider a setting where bounded deviations of agents' decisions from the equilibrium are possible, and uncertain constraints are…

The overall aim of our research is to develop techniques to reason about the equilibrium properties of multi-agent systems. We model multi-agent systems as concurrent games, in which each player is a process that is assumed to act…

We consider the general model of zero-sum repeated games (or stochastic games with signals), and assume that one of the players is fully informed and controls the transitions of the state variable. We prove the existence of the uniform…

Secure equilibrium is a refinement of Nash equilibrium, which provides some security to the players against deviations when a player changes his strategy to another best response strategy. The concept of secure equilibrium is specifically…