Simon (2003) presented an example of a 3-player Bayesian games with no Bayesian equilibria but it has been an open question whether or not there are games with no approximate Bayesian equilibria. We present an example of a Bayesian game with two players, two actions and a continuum of states that possesses no approximate Bayesian equilibria, thus resolving the question. As a side benefit we also have for the first time an an example of a 2-player Bayesian game with no Bayesian equilibria and an example of a strategic-form game with no approximate Nash equilibria. The construction makes use of techniques developed in an example by Y. Levy of a discounted stochastic game with no stationary equilibria.
To answer the question in the title we vary agents' beliefs against the background of a fixed knowledge space, that is, a state space with a partition for each agent. Beliefs are the posterior probabilities of agents, which we call type profiles. We then ask what is the topological size of the set of consistent type profiles, those that are derived from a common prior (or a common improper prior in the case of an infinite state space). The answer depends on what we term the tightness of the partition profile. A partition profile is tight if in some state it is common knowledge that any increase of any single agent's knowledge results in an increase in common knowledge. We show that for partition profiles that are tight the set of consistent type profiles is topologically large, while for partition profiles that are not tight this set is topologically small.
The question of 'why sex' has long been a puzzle. The randomness of recombination, which potentially produces low fitness progeny, contradicts notions of fitness landscape hill climbing. We use the concept of evolution as an algorithm for learning unpredictable environments to provide a possible answer. While sex and asex both implement similar machine learning no-regret algorithms in the context of random samples that are small relative to a vast genotype space, the algorithm of sex constitutes a more efficient goal-directed walk through this space. Simulations indicate this gives sex an evolutionary advantage, even in stable, unchanging environments. Asexual populations rapidly reach a fitness plateau, but the learning aspect of the no-regret algorithm most often eventually boosts the fitness of sexual populations past the maximal viability of corresponding asexual populations. In this light, the randomness of sexual recombination is not a hindrance but a crucial component of the 'sampling for learning' algorithm of sexual reproduction.
We show that every Bayesian game with purely atomic types has a measurable Bayesian equilibrium when the common knowledge relation is smooth. Conversely, for any common knowledge relation that is not smooth, there exists a type space that yields this common knowledge relation and payoffs such that the resulting Bayesian game does not have any Bayesian equilibrium. We show that our smoothness condition also rules out two paradoxes involving Bayesian games with a continuum of types: the impossibility of having a common prior on components when a common prior over the entire state space exists, and the possibility of interim betting/trade even when no such trade can be supported ex ante.
Assuming a 'spectrum' or ordering on the players of a coalitional game, as in a political spectrum in a parliamentary situation, we consider a variation of the Shapley value in which coalitions may only be formed if they are connected with respect to the spectrum. This results in a naturally asymmetric power index in which positioning along the spectrum is critical. We present both a characterisation of this value by means of properties and combinatoric formulae for calculating it. In simple majority games, the greatest power accrues to 'moderate' players who are located neither at the extremes of the spectrum nor in its centre. In supermajority games, power increasingly accrues towards the extremes, and in unaninimity games all power is held by the players at the extreme of the spectrum.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.