Abstract: In this paper we present a comprehensive analysis of large non-anonymous games in which the agents have a name as well as a type. The space of names is formu-lated as an abstract probability space while the space of types is a complete separable metric space. We show the existence of pure strategy Nash equilibria under alterna-tive cardinality assumptions on the common set of actions and on the space of types. When the action set is finite or countably infinite and compact, there exist pure strategy equilibria irrespective of any assumptions on the type space T. Two classes of results are presented on the atomless space of names: an abstract probability space or a Loeb probability space
This paper introduces a class of non-additive anonymous games where agents are assumed to be uncerta...
This paper analyzes a class of games of incomplete information where each agent has private informat...
Abstract. We consider a game with a continuum of players where at most a finite number of them are a...
We consider anonymous games with an atomless probability space of players in which players' characte...
We consider Nash equilibria of large anonymous games (i.e., each player’s payoff depends on his choi...
We consider Nash equilibria of large anonymous games (i.e., each player’s payoff depends on his cho...
In the context of anonymous games (i.e., games where the payoff of a player is, apart from his/her ow...
In this paper, we divide the players of a large game into countable different groups and assume that...
Over the years, several formalizations and existence results for games with a continuum of players h...
We present a purification result for incomplete information games with a large finite number of play...
We present results on the relationship between non-atomic games (in dis-tributional form) and approx...
This paper introduces a class of non-additive anonymous games where agents are assumed to be uncerta...
Over the years, several formalizations and existence results for games with a continuum of players h...
Carmona considered an increasing sequence of finite games in each of which players are characterized...
This paper elucidates the conceptual role that independent randomization plays in non-cooperative ga...
This paper introduces a class of non-additive anonymous games where agents are assumed to be uncerta...
This paper analyzes a class of games of incomplete information where each agent has private informat...
Abstract. We consider a game with a continuum of players where at most a finite number of them are a...
We consider anonymous games with an atomless probability space of players in which players' characte...
We consider Nash equilibria of large anonymous games (i.e., each player’s payoff depends on his choi...
We consider Nash equilibria of large anonymous games (i.e., each player’s payoff depends on his cho...
In the context of anonymous games (i.e., games where the payoff of a player is, apart from his/her ow...
In this paper, we divide the players of a large game into countable different groups and assume that...
Over the years, several formalizations and existence results for games with a continuum of players h...
We present a purification result for incomplete information games with a large finite number of play...
We present results on the relationship between non-atomic games (in dis-tributional form) and approx...
This paper introduces a class of non-additive anonymous games where agents are assumed to be uncerta...
Over the years, several formalizations and existence results for games with a continuum of players h...
Carmona considered an increasing sequence of finite games in each of which players are characterized...
This paper elucidates the conceptual role that independent randomization plays in non-cooperative ga...
This paper introduces a class of non-additive anonymous games where agents are assumed to be uncerta...
This paper analyzes a class of games of incomplete information where each agent has private informat...
Abstract. We consider a game with a continuum of players where at most a finite number of them are a...