This paper develops a theory of regular Markov perfect equilibria in dynamic stochastic games. We show that almost all dynamic stochastic games have a finite number of locally isolated Markov perfect equilibria that are all regular. These equilibria are essential and strongly stable. Moreover, they all admit purification. JEL classification numbers: C73, C61, C62.

In this paper, we investigate the existence of Pareto and weak Pareto equilibria for multiobjective games without compactness. By employing an existence theorem of Pareto equilibria due to Yu and Yuan([10]), several existence theorems of Pareto and weak Pareto equilibria for the multiobjective games are established in a similar way to Flores-Bázan([4]).

Nash equilibria with identical supports are compared for bimatrix games that are different with respect to the risk aversion of player 2. For equilibria in 2× 2-bimatrix games and for equilibria with efficient supports in coordination games it is established for which cases increased risk aversion of player 2 benefits or hurts player 2.

Standard bin packing is the problem of partitioning a set of items with positive sizes no larger than 1 into a minimum number of subsets (called bins) each having a total size of at most 1. In bin packing games, an item has a positive weight, and given a valid packing or partition of the items, each item has a cost or a payoff associated with it. We study a class of bin packing games where the ...

We study the complexity of computing equilibria in two classes of network games based on flows fractional BGP (Border Gateway Protocol) games and fractional BBC (Bounded Budget Connection) games. BGP is the glue that holds the Internet together and hence its stability, i.e. the equilibria of fractional BGP games [15], is a matter of practical importance. BBC games [21] follow in the tradition o...

We study how the structure of the interaction graph of a game affects the existence of pure Nash equilibria. In particular, for a fixed interaction graph, we are interested in whether there exist pure Nash equilibria which arise when random utility tables are assigned to the players. We provide conditions for the structure of the graph under which equilibria are likely to exist and complementar...

Multi-leader multi-follower games are a class of hierarchical games in which a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. The resulting equilibrium problem with equilibrium constraints is complicated by nonconvex agent problems and therefore providing tractable conditions for existence of global or even loca...

Drawing on ideas from game theory and quantum physics, we investigate nonlocal correlations from the point of view of equilibria in games of incomplete information. These equilibria can be classified in decreasing power as general communication equilibria, beliefinvariant equilibria and correlated equilibria, all of which contain the familiar Nash equilibria. The notion of belief-invariant equi...

Wages in traditional agrarian societies are often observed to be above reservation wages even in the slack season when markets are in a state of excess labour supply. Models of noncooperative wage setting by landlords which explicitly take account of the costs of supervising hired labour and emphasize worker heterogeneity are developed and analyzed. Conditions are given for the existence of com...

Many insights regarding rank-order tournaments rest upon contestants’ behavior in symmetric equilibria. As shown by Gill and Stone (2010), however, symmetric equilibria may not exist if contestants are expectation-based loss averse and have choice-acclimating expectations. We show that under choice-unacclimating—i.e., fixed— expectations both symmetric and asymmetric equilibria exist for all de...