( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Convergence Issues in Competitive Games.

, и . APPROX-RANDOM, том 3122 из Lecture Notes in Computer Science, стр. 183-194. Springer, (2004)

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.

Elsiamma Vettam

Adrian Gabriel

Adrian Bölingen

Adrian Chadi

Nadine Adrian

 

Другие публикации лиц с тем же именем

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