( en | de | ru )

 

Disambiguation of "Vetta, Adrian"

Author of the publication

copydeleteadd this publication to your clipboard
The Demand Matching Problem.

, and . IPCO, volume 2337 of Lecture Notes in Computer Science, page 457-474. Springer, (2002)

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

One Dollar Each Eliminates Envy., , , , and . EC, page 23-39. ACM, (2020)The Fair Division of Hereditary Set Systems., and . WINE, volume 11316 of Lecture Notes in Computer Science, page 297-311. Springer, (2018)Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality?, , and . SAGT, volume 12885 of Lecture Notes in Computer Science, page 281-295. Springer, (2021)An Improved Bound for the Tree Conjecture in Network Creation Games., and . SAGT, volume 13584 of Lecture Notes in Computer Science, page 241-257. Springer, (2022)Two Birds with One Stone: Fairness and Welfare via Transfers., , and . SAGT, volume 12885 of Lecture Notes in Computer Science, page 376-390. Springer, (2021)On the Implications of Lookahead Search in Game Playing, , and . CoRR, (2012)Approximate Min-max Relations for Odd Cycles in Planar Graphs., , , and . IPCO, volume 3509 of Lecture Notes in Computer Science, page 35-50. Springer, (2005)Nash Equilibria in Random Games., , and . FOCS, page 123-131. IEEE Computer Society, (2005)Eliminating Majority Illusion is Easy., , , , and . CoRR, (2024)One n Remains to Settle the Tree Conjecture., and . STACS, volume 289 of LIPIcs, page 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)