Author of the publication

New Algorithms for Approximate Nash Equilibria in Bimatrix Games.

, , and . WINE, volume 4858 of Lecture Notes in Computer Science, page 17-29. Springer, (2007)

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

Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions., , , and . WINE, volume 3828 of Lecture Notes in Computer Science, page 92-101. Springer, (2005)Towards a Characterization of Worst Case Equilibria in the Discriminatory Price Auction., , and . WINE, volume 13112 of Lecture Notes in Computer Science, page 186-204. Springer, (2021)Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design., , and . WINE, volume 10123 of Lecture Notes in Computer Science, page 414-428. Springer, (2016)Approximation Algorithms and Mechanism Design for Minimax Approval Voting., , and . AAAI, page 737-742. AAAI Press, (2010)Auction-Based Multi-Robot Routing., , , , , , , , and . Robotics: Science and Systems, page 343-350. The MIT Press, (2005)Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction., , , and . SAGT, volume 10504 of Lecture Notes in Computer Science, page 16-28. Springer, (2017)Approximation Algorithms for Computing Maximin Share Allocations., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 39-51. Springer, (2015)Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness., , , and . EC, page 545-562. ACM, (2017)Improved EFX Approximation Guarantees under Ordinal-based Assumptions., and . AAMAS, page 591-599. ACM, (2023)Complexity of Finding Equilibria of Plurality Voting Under Structured Preferences., , , and . AAMAS, page 394-401. ACM, (2016)