Fetching the paper…
Reading the bibliography…
We propose a simple yet rich model to extend the notions of Nash equilibria and correlated equilibria of strategic games to the quantum setting, in which we then study the relations between classical and quantum equilibria.
Theory of Games and Economic Behavior
John von Neumann and Oskar Morgenstern · 1944
Earlier work this paper cites.
Equilibrium points in n-person games
John Nash · 1950
Earlier work this paper cites.
Non-cooperative games
John Nash · 1951
Earlier work this paper cites.
On the Einstein-Podolsky-Rosen paradox
John Bell · 1965
Earlier work this paper cites.
Subjectivity and correlation in randomized strategies
Robert Aumann · 1974
Earlier work this paper cites.
The common information of two dependent random variables
Aaron Wyner · 1975
Earlier work this paper cites.
Expressing combinatorial optimization problems by linear programs
Mihalis Yannakakis · 1988
Earlier work this paper cites.
Nash and correlated equilibria: Some complexity considerations
Itzhak Gilboa and Eitan Zemel · 1989
Earlier work this paper cites.
Communication complexity: A survey. In book Paths, flows, and VLSI-layout edited by B. Korte, L. Lovász, H. Pr omel, and A. Schrijver, pages 235-265
László Lovász · 1990
Earlier work this paper cites.
Game theory
Drew Fudenberg and Jean Tirole · 1991
Earlier work this paper cites.
Lower bounds for non-commutative computation
Noam Nisan · 1991
Earlier work this paper cites.
A course in game theory
Martin Osborne and Ariel Rubinstein · 1994
Earlier work this paper cites.
Quantum Communication
I. Kremer · 1995
Earlier work this paper cites.
Quantum mechanics helps in searching for a needle in a haystack
Lov Grover · 1997
Earlier work this paper cites.
Quantum games and quantum strategies
Jens Eisert, Martin Wilkens, and Maciej Lewenstein · 1999
Earlier work this paper cites.
Quantum strategies
David Meyer · 1999
Earlier work this paper cites.
A quantum approach to static games of complete information
Luca Marinatto and Tullio Weber · 2000
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael Nielsen and Isaac Chuang · 2000
Earlier work this paper cites.
Comment on “quantum games and quantum strategies”
Simon Benjamin and Patrick Hayden · 2001
Earlier work this paper cites.
Multiplayer quantum games
Simon Benjamin and Patrick Hayden · 2001
Earlier work this paper cites.
The quantum monty hall problem
G.M. D’Ariano, R.D. Gill, M. Keyl, B. Kummerer, H. Maassen, and R.F. Werner · 2002
Earlier work this paper cites.
Experimental realization of quantum games on a quantum computer
Jiangfeng Du, Hui Li, Xiaodong Xu, Mingjun Shi, Jihui Wu, Xianyi Zhou, and Rongdian Han · 2002
Earlier work this paper cites.
Entanglement enhanced multiplayer quantum games
Jiangfeng Du, Hui Li, Xiaodong Xu, Xianyi Zhou, and Rongdian Han · 2002
Cited alongside, same era.
Quantum cooperative games
A. Iqbal and A. H. Toor · 2002
Cited alongside, same era.
The quantum communication complexity of sampling
Andris Ambainis, Leonard Schulman, Amnon Ta-Shma, Umesh Vazirani, and Avi Wigderson · 2003
Cited alongside, same era.
Advantage of a quantum player over a classical one in 2 x 2 quantum games
Adrian Flitney and Derek Abbott · 2003
Cited alongside, same era.
Efficiency and formalism of quantum games
Chiu Fan Lee and Neil Johnson · 2003
Cited alongside, same era.
A new protocol and lower bounds for quantum coin flipping
Andris Ambainis · 2004
Cited alongside, same era.
Generalized tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, and Andrew Chi-Chih Yao · 2008
Later among the works it cites.
Entangled games are hard to approximate
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, and Thomas Vidick · 2008
Later among the works it cites.
Theory of Quantum Information
John Watrous · 2008
Later among the works it cites.
Neurocomputing for vision research; advances in blind signal processing total variation norm-based nonnegative matrix factorization for identifying discriminant representation of image patterns
Taiping Zhang, Bin Fang, Weining Liu, Yuan-Yan Tang, Guanghui Hea, and Jing Wen · 2008
Later among the works it cites.
Real rank versus nonnegative rank
Leroy Beasley and Thomas Laffey · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
An information statistics approach to data stream and communication complexity
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar · 2004
Cited alongside, same era.
Consequences and limits of nonlocal strategies
Richard Cleve, Peter Hoyer, Ben Toner, and John Watrous · 2004
Cited alongside, same era.
Communication complexity as a lower bound for learning in games
Vincent Conitzer and Tuomas Sandholm · 2004
Cited alongside, same era.
Quantum speed-up of markov chain based algorithms
Mario Szegedy · 2004
Cited alongside, same era.
Nonnegative matrix factorization and applications
Moody Chu and Robert Plemmons · 2005
Cited alongside, same era.
Quantum games with decoherence
Adrian Flitney and Derek Abbott · 2005
Cited alongside, same era.
Xi Chen, Xiaotie Deng, and Shanghua Teng · 2009
Later among the works it cites.
Computing a nash equilibrium is PPAD-complete
Constantinos Daskalakis, Paul Goldberg, and Christos Papadimitriou · 2009
Later among the works it cites.
The communication complexity of correlation
Prahladh Harsha, Rahul Jain, David McAllester, and Jaikumar Radhakrishnan · 2009
Later among the works it cites.
Parallel approximation of non-interactive zero-sum quantum games
Rahul Jain and John Watrous · 2009
Later among the works it cites.
Using entanglement in quantum multi-prover interactive proofs
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, and Thomas Vidick · 2009
Later among the works it cites.
Nonlocality and communication complexity
Harry Buhrman, Richard Cleve, Serge Massar, and Ronald de Wolf · 2010
Closest in time.
On the nonnegative rank of euclidean distance matrices, II
Moody T. Chu · 2010
Closest in time.
Parallel approximation of min-max problems with applications to classical and quantum zero-sum games
Gus Gutoski and Xiaodi Wu · 2010
Closest in time.
How long to equilibrium? the communication complexity of uncoupled equilibrium procedures
Sergiu Hart and Yishay Mansour · 2010
Closest in time.
No strong parallel repetition with entangled and non-signaling provers
Julia Kempe and Oded Regev · 2010
Closest in time.
Unique games with entangled provers are easy
Julia Kempe, Oded Regev, and Ben Toner · 2010
Closest in time.
Euclidean distance matrices and applications
Nathan Krislock and Henry Wolkowicz · 2010
Closest in time.
On the nonnegative rank of euclidean distance matrices
Matthew M. Lin and Moody T. Chu · 2010
Closest in time.
Bounded-depth circuits cannot sample good codes
Shachar Lovett and Emanuele Viola · 2010
Closest in time.
The complexity of distributions
Emanuele Viola · 2010
Closest in time.
Nonnegative matrix factorization with bounded total variational regularization for face recognition
Haiqing Yin and Hongwei Liu · 2010
Closest in time.