From post

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.

 

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

Selfish routing with atomic players.. SODA, стр. 1184-1185. SIAM, (2005)A stronger bound on Braess's Paradox., , и . SODA, стр. 340-341. SIAM, (2004)Optimal mechanism design and money burning., и . STOC, стр. 75-84. ACM, (2008)Universally utility-maximizing privacy mechanisms., , и . STOC, стр. 351-360. ACM, (2009)The price of anarchy is independent of the network topology.. STOC, стр. 428-437. ACM, (2002)How bad is selfish routing?, и . J. ACM, 49 (2): 236-259 (2002)Quantifying inefficiency in cost-sharing mechanisms., и . J. ACM, 56 (4): 23:1-23:33 (2009)Fully Distributed Algorithms for Convex Optimization Problems., , и . DISC, том 4731 из Lecture Notes in Computer Science, стр. 492-493. Springer, (2007)Simultaneous Single-Item Auctions., и . WINE, том 7695 из Lecture Notes in Computer Science, стр. 337-349. Springer, (2012)Optimal Cost-Sharing Mechanisms for Steiner Forest Problems., , и . WINE, том 4286 из Lecture Notes in Computer Science, стр. 112-123. Springer, (2006)