Perfect Conditional ε‐Equilibria of Multi‐Stage Games With Infinite Sets of Signals and Actions

Econometrica ◽  
2020 ◽  
Vol 88 (2) ◽  
pp. 495-531 ◽  
Author(s):  
Roger B. Myerson ◽  
Philip J. Reny

We extend Kreps and Wilson's concept of sequential equilibrium to games with infinite sets of signals and actions. A strategy profile is a conditional ε‐equilibrium if, for any of a player's positive probability signal events, his conditional expected utility is within ε of the best that he can achieve by deviating. With topologies on action sets, a conditional ε‐equilibrium is full if strategies give every open set of actions positive probability. Such full conditional ε‐equilibria need not be subgame perfect, so we consider a non‐topological approach. Perfect conditional ε‐equilibria are defined by testing conditional ε‐rationality along nets of small perturbations of the players' strategies and of nature's probability function that, for any action and for almost any state, make this action and state eventually (in the net) always have positive probability. Every perfect conditional ε‐equilibrium is a subgame perfect ε‐equilibrium, and, in finite games, limits of perfect conditional ε‐equilibria as ε → 0 are sequential equilibrium strategy profiles. But limit strategies need not exist in infinite games so we consider instead the limit distributions over outcomes. We call such outcome distributions perfect conditional equilibrium distributions and establish their existence for a large class of regular projective games. Nature's perturbations can produce equilibria that seem unintuitive and so we augment the game with a net of permissible perturbations.

2003 ◽  
Vol 68 (4) ◽  
pp. 1242-1250
Author(s):  
Pavel Pudlák

AbstractWe consider combinatorial principles based on playing several two person games simultaneously. We call strategies for playing two or more games simultaneously parallel. The principles are easy consequences of the determinacy of games, in particular they are true for all finite games. We shall show that the principles fail for infinite games. The statements of these principles are of lower logical complexity than the sentence expressing the determinacy of games, therefore, they can be studied in weak axiomatic systems for arithmetic (Bounded Arithmetic). We pose several open problems about the provability of these statements in Bounded Arithmetic and related computational problems.


1985 ◽  
Vol 79 (4) ◽  
pp. 943-957 ◽  
Author(s):  
Dagobert L. Brito ◽  
Michael D. Intriligator

This article analyzes the circumstances under which conflict leads to the outbreak of war using a formal model which incorporates both the redistribution of resources as an alternative to war and imperfect information. Countries act as rational agents concerned with both consumption and the public bad of a war. In the first period both countries can either consume or build arms, whereas in the second period there can be either the threat or the use of force to reallocate resources. If both countries are fully informed, then there will be no war but rather a voluntary redistribution of resources. In a situation of asymmetric information, however, in which one country is fully informed and the other is not, a war can occur if the uninformed country uses a separating equilibrium strategy, precommitting itself to a positive probability of war in order to prevent bluffing by the informed country.


Author(s):  
Zhao-Yang Liu ◽  
Sheng-Jun Huang

Open-set classification is a common problem in many real world tasks, where data is collected for known classes, and some novel classes occur at the test stage. In this paper, we focus on a more challenging case where the data examples collected for known classes are all unlabeled. Due to the high cost of label annotation, it is rather important to train a model with least labeled data for both accurate classification on known classes and effective detection of novel classes. Firstly, we propose an active learning method by incorporating structured sparsity with diversity to select representative examples for annotation. Then a latent low-rank representation is employed to simultaneously perform classification and novel class detection. Also, the method along with a fast optimization solution is extended to a multi-stage scenario, where classes occur and disappear in batches at each stage. Experimental results on multiple datasets validate the superiority of the proposed method with regard to different performance measures.


Games ◽  
2019 ◽  
Vol 10 (3) ◽  
pp. 34
Author(s):  
Marek Mikolaj Kaminski

I introduce axiomatically infinite sequential games that extend Kuhn’s classical framework. Infinite games allow for (a) imperfect information, (b) an infinite horizon, and (c) infinite action sets. A generalized backward induction (GBI) procedure is defined for all such games over the roots of subgames. A strategy profile that survives backward pruning is called a backward induction solution (BIS). The main result of this paper finds that, similar to finite games of perfect information, the sets of BIS and subgame perfect equilibria (SPE) coincide for both pure strategies and for behavioral strategies that satisfy the conditions of finite support and finite crossing. Additionally, I discuss five examples of well-known games and political economy models that can be solved with GBI but not classic backward induction (BI). The contributions of this paper include (a) the axiomatization of a class of infinite games, (b) the extension of backward induction to infinite games, and (c) the proof that BIS and SPEs are identical for infinite games.


2011 ◽  
Vol 13 (03) ◽  
pp. 269-280 ◽  
Author(s):  
ORIOL CARBONELL-NICOLAU

In moving from finite-action to infinite-action games, standard refinements of the Nash equilibrium concept cease to satisfy certain "natural" properties. For instance, perfect equilibria in compact, continuous games need not be admissible. This paper highlights additional properties of two standard refinement specifications that are not inherited by supersets of the set of finite games. The analysis reveals the following about the behavior of perfectness and strategic stability within a class of (possibly) discontinuous games: (1) Equilibria that assign positive probability to the interior of the set of strategies weakly dominated for some player can be chosen; (2) nonadmissible equilibria need not be ruled out when they are weakly dominated by admissible perfect equilibria; and (3) nonadmissible equilibria may be selected when admissible equilibria are ruled out.


Game Theory ◽  
2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Julian C. Jamison

We study the dynamic structure of equilibria in game theory. Allowing players in a game the opportunity to renegotiate, or switch to a feasible and Pareto superior equilibrium, can lead to welfare gains. However, in an extensive-form game this can also make it more difficult to enforce punishment strategies, leading to the question of which equilibria are feasible after all. This paper attempts to resolve that question by presenting the first definition of renegotiation-proofness in general games. This new concept, the renegotiation perfect set, satisfies five axioms. The first three axioms—namely Rationality, Consistency, and Internal Stability—characterize weakly renegotiation-proof sets. There is a natural generalized tournament defined on the class of all WRP sets, and the final two axioms—External Stability and Optimality—pick a unique “winner” from this tournament. The tournament solution concept employed, termed the catalog, is based on Dutta’s minimal covering set and can be applied to many settings other than renegotiation. It is shown that the renegotiation perfection concept is an extension of the standard renegotiation-proof definition for finite games, introduced by (Benoit and Krishna 1993), and that it captures the notion of a strongly renegotiation-proof equilibrium as defined by (Farrell and Maskin 1989).


2020 ◽  
Vol 309 ◽  
pp. 05014
Author(s):  
Qihua Tian ◽  
Yurong Zhang ◽  
Qunmei Dong ◽  
Xiangman Zhou ◽  
Yixian Du

Aiming at the problem of unreasonable resource allocation in the existing coupling design iterative model based on efficiency constraint, the resource equilibrium strategy was introduced into the iterative model. In order to reduce the time cost of product development, a multi-stage iterative model with optimal resource allocation was constructed and the optimal resource allocation of each task group was obtained by solving this model. Taking the design and development process of an air purifier as an example, the validity of this model was verified. The research shows that after introducing resource equilibrium strategy into the iterative model based on efficiency constraint, the time cost of iterative mode in different stages decreases, and with the increase of the number of iteration stages, the time cost decreases first and then increases. The research results provide a theoretical basis for designers to reasonably select resource allocation mode and number of iteration stages in actual product development so as to optimize resource allocation and reduce development cost.


2010 ◽  
Vol 20 (2) ◽  
pp. 127-168 ◽  
Author(s):  
MARTÍN ESCARDÓ ◽  
PAULO OLIVA

Bar recursion arises in constructive mathematics, logic, proof theory and higher-type computability theory. We explain bar recursion in terms of sequential games, and show how it can be naturally understood as a generalisation of the principle of backward induction that arises in game theory. In summary, bar recursion calculates optimal plays and optimal strategies, which, for particular games of interest, amount to equilibria. We consider finite games and continuous countably infinite games, and relate the two. The above development is followed by a conceptual explanation of how the finite version of the main form of bar recursion considered here arises from a strong monad of selections functions that can be defined in any cartesian closed category. Finite bar recursion turns out to be a well-known morphism available in any strong monad, specialised to the selection monad.


2007 ◽  
Vol 44 (02) ◽  
pp. 492-505
Author(s):  
M. Molina ◽  
M. Mota ◽  
A. Ramos

We investigate the probabilistic evolution of a near-critical bisexual branching process with mating depending on the number of couples in the population. We determine sufficient conditions which guarantee either the almost sure extinction of such a process or its survival with positive probability. We also establish some limiting results concerning the sequences of couples, females, and males, suitably normalized. In particular, gamma, normal, and degenerate distributions are proved to be limit laws. The results also hold for bisexual Bienaymé–Galton–Watson processes, and can be adapted to other classes of near-critical bisexual branching processes.


2011 ◽  
Author(s):  
Jared Hotaling ◽  
Jerry Busemeyer ◽  
Richard Shiffrin

Sign in / Sign up

Export Citation Format

Share Document