( en | de | ru )

 

Disambiguation of "Vetta, Adrian"

Author of the publication

copydeleteadd this publication to your clipboard
Large Supports are Required for Well-Supported Nash Equilibria.

, , , , , and . APPROX-RANDOM, volume 40 of LIPIcs, page 78-84. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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.

Elsiamma Vettam

Adrian Dohna

Adrian Jonescu

Adrian Forster

Adrian Barbu

 

Other publications of authors with the same name

Approximate min-max relations for odd cycles in planar graphs., , , and . Math. Program., 110 (1): 71-91 (2007)An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph., , and . SIAM J. Comput., 32 (4): 1050-1055 (2003)Approximation algorithms for minimum-cost k-vertex connected subgraphs., , and . STOC, page 306-312. ACM, (2002)A Priority-Based Model of Routing., , and . Chic. J. Theor. Comput. Sci., (2008)Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3., , , and . WINE, volume 8289 of Lecture Notes in Computer Science, page 15-23. Springer, (2013)Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets., , and . SAGT, volume 11059 of Lecture Notes in Computer Science, page 267-271. Springer, (2018)False-Name Bidding and Economic Efficiency in Combinatorial Auctions., and . AAAI, page 538-544. AAAI Press, (2014)A Case Study in Learning in Metagames: Super Smash Bros. Melee., and . AIIDE, page 2-9. AAAI Press, (2021)On Clusterings - Good, Bad and Spectral., , and . FOCS, page 367-377. IEEE Computer Society, (2000)Gerrymandering Planar Graphs., , , , and . AAMAS, page 463-471. International Foundation for Autonomous Agents and Multiagent Systems / ACM, (2024)