Published in: LIPIcs, Volume 116, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)
Anat Ganor and Karthik C. S.. Communication Complexity of Correlated Equilibrium with Small Support. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 116, pp. 12:1-12:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ganor_et_al:LIPIcs.APPROX-RANDOM.2018.12, author = {Ganor, Anat and C. S., Karthik}, title = {{Communication Complexity of Correlated Equilibrium with Small Support}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {12:1--12:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-085-9}, ISSN = {1868-8969}, year = {2018}, volume = {116}, editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.12}, URN = {urn:nbn:de:0030-drops-94163}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.12}, annote = {Keywords: Correlated equilibrium, Nash equilibrium, Communication complexity} }
Published in: LIPIcs, Volume 94, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
Mark Braverman, Anat Ganor, Gillat Kol, and Ran Raz. A Candidate for a Strong Separation of Information and Communication. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 94, pp. 11:1-11:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{braverman_et_al:LIPIcs.ITCS.2018.11, author = {Braverman, Mark and Ganor, Anat and Kol, Gillat and Raz, Ran}, title = {{A Candidate for a Strong Separation of Information and Communication}}, booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)}, pages = {11:1--11:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-060-6}, ISSN = {1868-8969}, year = {2018}, volume = {94}, editor = {Karlin, Anna R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.11}, URN = {urn:nbn:de:0030-drops-83322}, doi = {10.4230/LIPIcs.ITCS.2018.11}, annote = {Keywords: communication complexity, amortized communication complexity, communication compression, direct sum, information complexity} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Gil Cohen, Anat Ganor, and Ran Raz. Two Sides of the Coin Problem. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 618-629, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{cohen_et_al:LIPIcs.APPROX-RANDOM.2014.618, author = {Cohen, Gil and Ganor, Anat and Raz, Ran}, title = {{Two Sides of the Coin Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {618--629}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.618}, URN = {urn:nbn:de:0030-drops-47265}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.618}, annote = {Keywords: bounded depth circuits, read once branching programs, Santha-Vazirani sources, the coin problem} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Anat Ganor and Ran Raz. Space Pseudorandom Generators by Communication Complexity Lower Bounds. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 692-703, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{ganor_et_al:LIPIcs.APPROX-RANDOM.2014.692, author = {Ganor, Anat and Raz, Ran}, title = {{Space Pseudorandom Generators by Communication Complexity Lower Bounds}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {692--703}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.692}, URN = {urn:nbn:de:0030-drops-47324}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.692}, annote = {Keywords: Communication complexity, Logspace, Pseudorandom generator} }
Feedback for Dagstuhl Publishing