Author of the publication

On the Existence of Nash Equilibrium in Games with Resource-Bounded Players.

, , and . SAGT, volume 11801 of Lecture Notes in Computer Science, page 139-152. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Smoothed Analysis on Connected Graphs., , and . APPROX-RANDOM, volume 28 of LIPIcs, page 810-825. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Size and Depth Separation in Approximating Benign Functions with Neural Networks., , , and . COLT, volume 134 of Proceedings of Machine Learning Research, page 4195-4223. PMLR, (2021)Inference in Sparse Graphs with Pairwise Measurements and Side Information., , and . AISTATS, volume 84 of Proceedings of Machine Learning Research, page 1810-1818. PMLR, (2018)On Percolation and NP-Hardness., , and . ICALP, volume 55 of LIPIcs, page 80:1-80:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)New bounds for contagious sets.. Discret. Math., 312 (10): 1812-1814 (2012)Contagious Sets in Expanders., , , and . SODA, page 1953-1987. SIAM, (2015)How Many Neurons Does it Take to Approximate the Maximum?, , and . SODA, page 3156-3183. SIAM, (2024)Leveraging seed dictionaries to improve dictionary learning., , and . ICIP, page 3723-3727. IEEE, (2016)Improved Lower Bounds on the Expected Length of Longest Common Subsequences., , , , , and . CoRR, (2024)Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in Networks., and . APPROX/RANDOM, volume 245 of LIPIcs, page 7:1-7:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)