English
Related papers

Related papers: The Electromagnetic Balance Game: A Probabilistic …

200 papers

We study the complexity of deciding the existence of mixed equilibria for minimization games where players use valuations other than expectation to evaluate their costs. We consider risk-averse players seeking to minimize the sum…

Computer Science and Game Theory · Computer Science 2015-11-02 Marios Mavronicolas , Burkhard Monien

Quantum games with incomplete information can be studied within a Bayesian framework. We consider a version of prisoner's dilemma (PD) in this framework with three players and characterize the Nash equilibria. A variation of the standard PD…

Quantum Physics · Physics 2017-03-10 Neal Solmeyer , Ricky Dixon , Radhakrishnan Balu

We review the quantum version of a well known problem of cryptography called coin tossing (``flipping a coin via telephone''). It can be regarded as a game where two remote players (who distrust each other) tries to generate a uniformly…

Quantum Physics · Physics 2007-05-23 C. Doescher , M. Keyl

The non-extensibility of quantum theory into a theory with improved predictive power is based on a strong assumption of independent free choice, in which the physicists pick a measurement axis independently of anything that couldn't have…

Quantum Physics · Physics 2019-09-12 Ghislain Fourny

In this paper, we will present an algorithm to resolve the counterfeit coins problem in the case that the number of false coins is unknown in advance.

Combinatorics · Mathematics 2010-04-06 An-Ping Li

Game-theoretic techniques and equilibria analysis facilitate the design and verification of competitive systems. While algorithmic complexity of equilibria computation has been extensively studied, practical implementation and application…

Computer Science and Game Theory · Computer Science 2022-02-02 Marta Kwiatkowska , Gethin Norman , David Parker , Gabriel Santos

A robust game is a distribution-free model to handle ambiguity generated by a bounded set of possible realizations of the values of players' payoff functions. The players are worst-case optimizers and a solution, called robust-optimization…

Theoretical Economics · Economics 2020-02-11 Giovanni Paolo Crespi , Davide Radi , Matteo Rocca

Suppose we are given a set of t coins which look identical, but a known number s of them are counterfeit, with a known weight different from the others. Our problem is to locate the counterfeits by weighing subsets of the t coins, with as…

Combinatorics · Mathematics 2007-05-23 Shaohui Zhai

Quantum entanglement has been recently demonstrated as a useful resource in conflicting interest games of incomplete information between two players, Alice and Bob [Pappa et al., Phys. Rev. Lett. 114, 020401 (2015)]. General setting for…

Quantum Physics · Physics 2017-11-17 Ashutosh Rai , Goutam Paul

The quantum mechanical approach to the well known prisoners dilemma, one of the basic examples to illustrate the concepts of Game Theory, is implemented with a classical optical resource, nonquantum entanglement between spin and orbital…

We introduce games with probabilistic uncertainty, a natural model for controller synthesis in which the controller observes the state of the system through imprecise sensors that provide correct information about the current state with a…

Computer Science and Game Theory · Computer Science 2012-07-03 Krishnendu Chatterjee , Martin Chmelik , Rupak Majumdar

In a nonlocal game, two noncommunicating players cooperate to convince a referee that they possess a strategy that does not violate the rules of the game. Quantum strategies allow players to optimally win some games by performing joint…

Quantum Physics · Physics 2025-07-01 Jim Furches , Sarah Chehade , Kathleen Hamilton , Nathan Wiebe , Carlos Ortiz Marrero

We generalize Ebert's Hat Problem for three persons and three colors. All players guess simultaneously the color of their own hat observing only the hat colors of the other players. It is also allowed for each player to pass: no color is…

Information Theory · Computer Science 2023-04-06 Theo van Uem

We study a game puzzle that has enjoyed recent popularity among mathematicians, computer scientist, coding theorists and even the mass press. In the game, $n$ players are fitted with randomly assigned colored hats. Individual players can…

Information Theory · Computer Science 2007-07-16 Hendrik W. Lenstra , Gadiel Seroussi

Stochastic multi-armed bandits solve the Exploration-Exploitation dilemma and ultimately maximize the expected reward. Nonetheless, in many practical problems, maximizing the expected reward is not the most desirable objective. In this…

Machine Learning · Computer Science 2013-01-10 Amir Sani , Alessandro Lazaric , Rémi Munos

As part of an effort to apply the rigorous guarantees of formal verification to multi-agent systems, the field of equilibrium analysis, also called rational verification, studies equilibria in multiplayer games to reason about system-level…

Computer Science and Game Theory · Computer Science 2026-04-28 Senthil Rajasekaran , Jean-François Raskin , Moshe Y. Vardi

We give an algorithm for solving stochastic parity games with almost-sure winning conditions on {\it lossy channel systems}, under the constraint that both players are restricted to finite-memory strategies. First, we describe a general…

Logic in Computer Science · Computer Science 2019-03-14 Parosh Aziz Abdulla , Lorenzo Clemente , Richard Mayr , Sven Sandberg

Conventional noncooperative game theory hypothesizes that the joint strategy of a set of players in a game must satisfy an "equilibrium concept". All other joint strategies are considered impossible; the only issue is what equilibrium…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 David H. Wolpert

This work lies in the fusion of experimental economics and data mining. It continues author's previous work on mining behaviour rules of human subjects from experimental data, where game-theoretic predictions partially fail to work.…

Computer Science and Game Theory · Computer Science 2012-11-13 Rustam Tagiew

We describe an efficient algorithm to compute solutions for the general two-player Blotto game on n battlefields with heterogeneous values. While explicit constructions for such solutions have been limited to specific, largely symmetric or…

Computer Science and Game Theory · Computer Science 2022-06-01 Vianney Perchet , Philippe Rigollet , Thibaut Le Gouic