Ex ante versus ex post equilibria in classical Bayesian games with a nonlocal resource

• URL: http://arxiv.org/abs/2005.12727v1
• Date: Tue, 26 May 2020 13:53:56 GMT
• Title: Ex ante versus ex post equilibria in classical Bayesian games with a nonlocal resource
• Authors: M\'aty\'as Koniorczyk, Andr\'as Bodor, Mikl\'os Pint\'er
• Abstract summary: We analyze the difference between ex ante and ex post equilibria in classical games played with the assistance of a nonlocal resource. We introduce a new type of game, based on the Bell-theorem by V'ertesi and Bene, which does not have the latter property.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We analyze the difference between ex ante and ex post equilibria in classical games played with the assistance of a nonlocal (quantum or no-signaling) resource. In physics, the playing of these games is known as performing bipartite Bell-type experiments. By analyzing the Clauser-Horn-Shimony-Holt game, we find a constructive procedure to find two-person Bayesian games with a nonlocal (i.e. no-signaling, and, in many cases, quantum) advantage. Most games of this kind known from the literature can be constructed along this principle, and share the property that their relevant ex ante equilibria are ex post equilibria as well. We introduce a new type of game, based on the Bell-theorem by V\'ertesi and Bene, which does not have the latter property: the ex ante and ex post equilibria differ.

Related papers

• Post-selection games [0.0]
  We introduce post-selection games, a generalization of nonlocal games where each round can be won or lost by the players, but also discarded by the referee.<n>We develop algorithms for computing the local and unbounded Tsirelson bounds of post-selection games.
  arXiv  Detail & Related papers  (2026-01-26T19:00:00Z)
• Guess your neighbor's input: Quantum advantage in Feige's game [3.160549625774197]
  We study a nonlocal game with two questions and three answers per player, which was first considered by Feige in 1991.<n>We prove that the game is a robust self-test for the $3$-dimensional maximally entangled state.
  arXiv  Detail & Related papers  (2025-10-09T17:25:35Z)
• Sink equilibria and the attractors of learning in games [0.0]
  Characterizing the limit behavior -- that is, the attractors -- of learning dynamics is one of the most fundamental open questions in game theory. We show through a topological construction that the one-to-one conjecture is false. Second, we make progress on the attractor characterization problem for two-player games by establishing that the one-to-one conjecture is true.
  arXiv  Detail & Related papers  (2025-02-11T21:40:11Z)
• Some consequences of Sica's approach to Bell's inequalities [55.2480439325792]
  Louis Sica derived Bell's inequalities from the hypothesis that the time series of outcomes observed in one station does not change if the setting in the other station is changed. In this paper, Sica's approach is extended to series with non ideal efficiency and to the actual time structure of experimental data.
  arXiv  Detail & Related papers  (2024-03-05T13:59:52Z)
• Photonic implementation of the quantum Morra game [69.65384453064829]
  We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case. We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game. We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
  arXiv  Detail & Related papers  (2023-11-14T19:41:50Z)
• Counterexamples in self-testing [0.0]
  We study self-testing in nonlocal games. In particular, could it be that every 2-party nonlocal game or Bell inequality with a quantum advantage certifies the presence of a specific quantum state? Our counterexamples are based on a class of games to be of independent interest.
  arXiv  Detail & Related papers  (2022-12-22T09:52:18Z)
• Connecting XOR and XOR* games [0.0]
  We focus on two classes of games: XOR nonlocal games and XOR* sequential games with monopartite resources. We prove that under certain assumptions these two classes of games can be related via an explicit theorem that connects their optimal strategies.
  arXiv  Detail & Related papers  (2022-10-02T00:11:38Z)
• Learning Correlated Equilibria in Mean-Field Games [62.14589406821103]
  We develop the concepts of Mean-Field correlated and coarse-correlated equilibria. We show that they can be efficiently learnt in emphall games, without requiring any additional assumption on the structure of the game.
  arXiv  Detail & Related papers  (2022-08-22T08:31:46Z)
• Constructive nonlocal games with very small classical values [0.0]
  This paper is devoted to analyzing classical values of the so-called linear games. We employ nontrivial results from graph theory and number theoretic results used earlier in the context of harmonic analysis.
  arXiv  Detail & Related papers  (2021-12-14T20:55:16Z)
• Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games [78.65798135008419]
  It remains vastly open how to learn the Stackelberg equilibrium in general-sum games efficiently from samples. This paper initiates the theoretical study of sample-efficient learning of the Stackelberg equilibrium in two-player turn-based general-sum games.
  arXiv  Detail & Related papers  (2021-02-23T05:11:07Z)
• Multistage games and Bell scenarios with communication [0.9176056742068814]
  Bell nonlocality is a cornerstone of quantum theory with applications in information processing ranging from cryptography to distributed computing and game theory. It is known that Bell's theorem can be formally linked to Bayesian games, allowing the use of nonlocal correlations to advise players and achieve new points of equilibrium that are unavailable classically. Here we generalize this link, proving the connection between multistage games of incomplete information with Bell scenarios involving the communication of measurement outcomes between the parties.
  arXiv  Detail & Related papers  (2020-12-01T18:51:40Z)
• No-regret learning and mixed Nash equilibria: They do not mix [64.37511607254115]
  We study the dynamics of "follow-the-regularized-leader" (FTRL) We show that any Nash equilibrium which is not strict cannot be stable and attracting under FTRL. This result has significant implications for predicting the outcome of a learning process.
  arXiv  Detail & Related papers  (2020-10-19T13:49:06Z)
• Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond [107.14897720357631]
  We show that an optimal correlated equilibrium can be computed in time in two-player games with public chance moves. This results in the biggest positive complexity result surrounding extensive-form correlation in more than a decade.
  arXiv  Detail & Related papers  (2020-09-09T14:51:58Z)
• Empirical Analysis of Fictitious Play for Nash Equilibrium Computation in Multiplayer Games [0.4895118383237099]
  fictitious play is guaranteed to converge to Nash equilibrium in certain game classes, such as two-player zero-sum games. We show that fictitious play in fact leads to improved Nash equilibrium approximation over a variety of game classes and sizes.
  arXiv  Detail & Related papers  (2020-01-30T03:47:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.