scientific article
From MaRDI portal
Publication:3549639
zbMath1211.68211MaRDI QIDQ3549639
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Signaling and communication in game theory (91A28) Multistage and repeated games (91A20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial probability (60C99)
Related Items (16)
Quantum hedging in two-round prover-verifier interactions ⋮ Bridging the gap between general probabilistic theories and the device-independent framework for nonlocality and contextuality ⋮ Derandomized parallel repetition theorems for free games ⋮ Unbounded violations of bipartite Bell inequalities via operator space theory ⋮ Pseudorandom sets in Grassmann graph have near-perfect expansion ⋮ Communication and information complexity ⋮ The Hilbertian tensor norm and entangled two-prover games ⋮ Information value of two-prover games ⋮ A monogamy-of-entanglement game with applications to device-independent quantum cryptography ⋮ Large violation of Bell inequalities with low entanglement ⋮ New Strong Direct Product Results in Communication Complexity ⋮ Parallel Repetition of the Odd Cycle Game ⋮ Definable Inapproximability: New Challenges for Duplicator ⋮ An Efficient Parallel Repetition Theorem ⋮ Almost Optimal Bounds for Direct Product Threshold Theorem ⋮ Unnamed Item
This page was built for publication:
