Search results for "Persona"
showing 10 items of 4542 documents
Constrained consensus for bargaining in dynamic coalitional TU games
2011
We consider a sequence of transferable utility (TU) games where, at each time, the characteristic function is a random vector with realizations restricted to some set of values. We assume that the players in the game interact only with their neighbors, where the neighbors may vary over time. The main contributions of the paper are the definition of a robust (coalitional) TU game and the development of a distributed bargaining protocol. We prove the convergence with probability 1 of the bargaining protocol to a random allocation that lies in the core of the robust game under some mild conditions on the players' communication graphs.
Provable Advantage for Quantum Strategies in Random Symmetric XOR Games
2013
Non-local games are widely studied as a model to investigate the properties of quantum mechanics as opposed to classical mechanics. In this paper, we consider a subset of non-local games: symmetric XOR games of $n$ players with 0-1 valued questions. For this class of games, each player receives an input bit and responds with an output bit without communicating to the other players. The winning condition only depends on XOR of output bits and is constant w.r.t. permutation of players. We prove that for almost any $n$-player symmetric XOR game the entangled value of the game is $\Theta (\frac{\sqrt{\ln{n}}}{n^{1/4}})$ adapting an old result by Salem and Zygmund on the asymptotics of random tr…
Worst case analysis of non-local games
2011
Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a referee. The players cannot communicate but may share common random bits or a common quantum state. A referee sends an input $x_i$ to the $i^{th}$ player who then responds by sending an answer $a_i$ to the referee. The players win if the answers $a_i$ satisfy a condition that may depend on the inputs $x_i$. Typically, non-local games are studied in a framework where the referee picks the inputs from a known probability distribution. We initiate the study …
Values of games with probabilistic graphs
1999
Abstract In this paper we consider games with probabilistic graphs. The model we develop is an extension of the model of games with communication restrictions by Myerson (1977) . In the Myerson model each pair of players is joined by a link in the graph if and only if these two players can communicate directly. The current paper considers a more general setting in which each pair of players has some probability of direct communication. The value is defined and characterized in this context. It is a natural extension of the Myerson value and it turns out to be the Shapley value of a modified game.
REPEATED GAMES WITH PROBABILISTIC HORIZON
2005
Repeated games with probabilistic horizon are defined as those games where players have a common probability structure over the length of the game's repetition, T. In particular, for each t, they assign a probability pt to the event that "the game ends in period t". In this framework we analyze Generalized Prisoners' Dilemma games in both finite stage and differentiable stage games. Our construction shows that it is possible to reach cooperative equilibria under some conditions on the distribution of the discrete random variable T even if the expected length of the game is finite. More precisely, we completely characterize the existence of sub-game perfect cooperative equilibria in finite s…
Quantum-over-Classical Advantage in Solving Multiplayer Games
2020
We study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap Nim games.
Advantage of Quantum Strategies in Random Symmetric XOR Games
2013
Non-local games are known as a simple but useful model which is widely used for displaying nonlocal properties of quantum mechanics. In this paper we concentrate on a simple subset of non-local games: multiplayer XOR games with 1-bit inputs and 1-bit outputs which are symmetric w.r.t. permutations of players.
Population Games with Vector Payoff and Approachability
2016
This paper studies population games with vector payoffs. It provides a new perspective on approachability based on mean-field game theory. The model involves a Hamilton-Jacobi-Bellman equation which describes the best-response of every player given the population distribution and an advection equation, capturing the macroscopic evolution of average payoffs if every player plays its best response.
Chess recognition using 3D patterned illumination camera
2021
Computer Vision has been applied to augment traditional board games such as Chess for a number of reasons. While augmented reality enhances the gaming experience, the required additional hardware (e.g. head gear) is still not widely accepted in everyday leisure activities, and therefore, camera based methods have been developed to interface the computer with the real-life chess board. However, traditional 2D camera approaches suffer from ill-defined environmental conditions (lighting, viewing angle) and are therefore severely limited in their application. To answer this issue, we have incorporated a consumer-grade depth camera based on patterned illumination. We could show that in combinati…
Customization Support in Computer-Based Technologies for Autism: A Systematic Mapping Study
2020
Autism Spectrum Disorder (ASD) is a neurodevelopmental condition characterized by social interaction and communication difficulties, along with narrow and repetitive interests. Being a spectrum dis...