Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1605.07896

Belief-Invariant and Quantum Equilibria in Games of Incomplete Information

Vincenzo Auletta·Diodato Ferraioli·Ashutosh Rai·Giannicola Scarpa·Andreas Winter
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 communication equilibria, belief-invariant equilibria, and correlated equilibria, all of which contain the familiar Nash equilibria. The notion of belief-invariant equilibrium appeared in game theory in the 90s. However, the class of non-signalling correlations associated to belief-invariance arose naturally already in the 80s in the foundations of quantum mechanics. In the present work, we explain and unify these two origins of the idea and study the above classes of equilibria, together with quantum correlated equilibria, using tools from quantum information but the language of (algorithmic) game theory. We present a general framework of belief-invariant communication equilibria, which contains correlated equilibria and quantum correlated equilibria as special cases. Our framework also contains the theory of Bell inequalities and their violations due to non-locality, which is a question of intense interest in the foundations of quantum mechanics, and it was indeed the original motivation for the aforementioned studies. Moreover, in our framework we can also model quantum games where players have conflicting interests, a recent developing topic in physics. We then use our framework to show new results related to the social welfare of equilibria. Namely, we exhibit a game where belief-invariance is socially better than any correlated equilibrium, and a game where all non-belief-invariant communication equilibria have a suboptimal social welfare. We also show that optimal social welfare can sometimes be achieved by quantum mechanical correlations, which do not need an informed mediator to be implemented, and go beyond the classical shared randomness approach.

Explore related subjects

cs.GTquant-ph

Keep this discovery

BibTeXRIS

Vincenzo Auletta, Diodato Ferraioli, Ashutosh Rai, Giannicola Scarpa, Andreas Winter. 2016-05-25. Belief-Invariant and Quantum Equilibria in Games of Incomplete Information. https://doi.org/10.1016/j.tcs.2021.09.041

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗