SearcharxivSearch

arXiv · 1804.02806

Prior Independent Equilibria and Linear Multi-dimensional Bayesian Games

Abstract

We show that a Bayesian strategy map profile is a Bayesian Nash Equilibrium independent of any prior if and only if the Bayesian strategy map profile, evaluated at any type profile, is the Nash equilibrium of the so-called local deterministic game corresponding to that type profile. We call such a Bayesian game type-regular. We then show that an m-dimensional n-agent Bayesian game whose utilities are linearly dependent on the types of the agents is equivalent, following a normalisation of the type space of each agent into the (m-1)-simplex, to a simultaneous competition in nm so-called basic n-agent games. If the game is own-type-linear, i.e., the utility of each player only depends linearly on its own type, then the Bayesian game is equivalent to a simultaneous competition in m basic n-agent games, called a multi-game. We then prove that an own-type-linear Bayesian game is type-regular if it is type-regular on the vertices of the (m-1)-simplex, a result which provides a large class of type-regular Bayesian maps. The class of m-dimensional own-type-linear Bayesian games can model, via their equivalence with multi-games, simultaneous decision-making in m different environments. We show that a two dimensional own-type-linear Bayesian game can be used to give a new model of the Prisoner's Dilemma (PD) in which the prosocial tendencies of the agents are considered as their types and the two agents play simultaneously in the PD as well as in a prosocial game. This Bayesian game addresses the materialistic and the prosocial tendencies of the agents. Similarly, we present a new two dimensional Bayesian model of the Trust game in which the type of the two agents reflect their prosocial tendency or trustfulness, which leads to more reasonable Nash equilibria. We finally consider an example of such multi-environment decision making in production by several companies in multi-markets.

Explore related subjects

Keep this discovery

BibTeXRIS

Abbas Edalat, Samira Hossein Ghorban. 2018-04-09. Prior Independent Equilibria and Linear Multi-dimensional Bayesian Games. https://arxiv.org/abs/1804.02806

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT