scholarly journals Rationalization and Identification of Binary Games with Correlated Types

2016 ◽  
Author(s):  
Nianqing Liu ◽  
Quang Vuong ◽  
Haiqing Xu
Keyword(s):  
Binary Games

Bounds for best response functions in binary games

2012 ◽  
Vol 166 (1) ◽  
pp. 92-105 ◽  
Author(s):  
Brendan Kline ◽  
Elie Tamer
Keyword(s):  
Response Functions ◽  
Best Response ◽  
Binary Games

Binary games with many players

2006 ◽  
Vol 28 (1) ◽  
pp. 125-143 ◽  
Author(s):  
Flavio M. Menezes ◽  
Rohan Pitchford
Keyword(s):  
Binary Games

scholarly journals A note on identification of discrete choice models for bundles and binary games

10.3982/qe489 ◽  
2017 ◽  
Vol 8 (3) ◽  
pp. 1021-1036 ◽  
Author(s):  
Jeremy T. Fox ◽  
Natalia Lazzati
Keyword(s):  
Discrete Choice ◽  
Choice Models ◽  
Discrete Choice Models ◽  
Binary Games

Some Binary Games

1944 ◽  
Vol 28 (280) ◽  
pp. 96 ◽  
Author(s):  
R. S. Scorer ◽  
P. M. Grundy ◽  
C. A. B. Smith
Keyword(s):  
Binary Games

scholarly journals Semi-algebraic sets and equilibria of binary games

2016 ◽  
Vol 44 (1) ◽  
pp. 19-24 ◽  
Author(s):  
Guillaume Vigeral ◽  
Yannick Viossat
Keyword(s):  
Algebraic Sets ◽  
Binary Games

scholarly journals A lower bound on the value of entangled binary games

2010 ◽  
Vol 10 (11&12) ◽  
pp. 911-924
Author(s):  
Salman Beigi
Keyword(s):  
Lower Bound ◽  
Optimal Strategy ◽  
A Priori ◽  
Semidefinite Program ◽  
Property A ◽  
Marginal Distributions ◽  
Winning Probability ◽  
Questions And Answers ◽  
Binary Games ◽  
Binary Game

A two-player one-round binary game consists of two cooperative players who each replies by one bit to a message that he receives privately; they win the game if both questions and answers satisfy some predetermined property. A game is called entangled if the players are allowed to share a priori entanglement. It is well-known that the maximum winning probability (value) of entangled XOR-games (binary games in which the predetermined property depends only on the XOR of the two output bits) can be computed by a semidefinite program. In this paper we extend this result in the following sense; if a binary game is uniform, meaning that in an optimal strategy the marginal distributions of the output of each player are uniform, then its entangled value can be efficiently computed by a semidefinite program. We also introduce a lower bound on the entangled value of a general two-player one-round game; this bound depends on the size of the output set of each player and can be computed by a semidefinite program. In particular, we show that if the game is binary, $\omega_q$ is its entangled value, and $\omega_{sdp}$ is the optimum value of the corresponding semidefinite program, then $0.68\,\omega_{sdp} < \omega_q \leq \omega_{sdp}$.

Understanding draws in Elo rating algorithm

2020 ◽  
Vol 16 (3) ◽  
pp. 211-220
Author(s):  
Leszek Szczecinski ◽  
Aymen Djebbi
Keyword(s):  
Loss Probability ◽  
The Other ◽  
Premier League ◽  
Other Hand ◽  
Davidson Algorithm ◽  
English Premier League ◽  
Binary Games

AbstractThis work is concerned with the interpretation of the results produced by the well known Elo algorithm applied in various sport ratings. The interpretation consists in defining the probabilities of the game outcomes conditioned on the ratings of the players and should be based on the probabilistic rating-outcome model. Such a model is known in the binary games (win/loss), allowing us to interpret the rating results in terms of the win/loss probability. On the other hand, the model for the ternary outcomes (win/loss/draw) has not been yet shown even if the Elo algorithm has been used in ternary games from the very moment it was devised. Using the draw model proposed by Davidson in 1970, we derive a new Elo-Davidson algorithm, and show that the Elo algorithm is its particular instance. The parameters of the Elo-Davidson are then related to the frequency of draws which indicates that the Elo algorithm silently assumes games with 50% of draws. To remove this assumption, often unrealistic, the Elo-Davidson algorithm should be used as it improves the fit to the data. The behaviour of the algorithms is illustrated using the results from English Premier League.

Binary games in constitutional form and collective choice

1988 ◽  
Vol 16 (2) ◽  
pp. 189-201 ◽  
Author(s):  
Nicolas G. Andjiga ◽  
Joël Moulen
Keyword(s):  
Collective Choice ◽  
Binary Games

Binary Games as Models of Public Goods Provision*

1986 ◽  
Vol 9 (4) ◽  
pp. 337-360 ◽  
Author(s):  
Jon Hovi
Keyword(s):  
Public Goods ◽  
Public Goods Provision ◽  
Binary Games

scholarly journals From Observable Behaviors to Structures of Interaction in Binary Games of Strategic Complements

Entropy ◽  
2013 ◽  
Vol 15 (12) ◽  
pp. 4648-4667 ◽  
Author(s):  
Tomás Rodríguez Barraquer
Keyword(s):  
Strategic Complements ◽  
Binary Games
Sign in / Sign up

Export Citation Format

Share Document