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.

 

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

Braess's paradox in large random graphs., и . EC, стр. 296-305. ACM, (2006)Optimal Efficiency Guarantees for Network Design Mechanisms., и . IPCO, том 4513 из Lecture Notes in Computer Science, стр. 469-483. Springer, (2007)Bertrand Competition in Networks., и . SAGT, том 4997 из Lecture Notes in Computer Science, стр. 70-82. Springer, (2008)Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability., , , и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 497-512. Springer, (2005)Worst-Case Efficiency Analysis of Queueing Disciplines., и . ICALP (2), том 5556 из Lecture Notes in Computer Science, стр. 546-557. Springer, (2009)Why Prices Need Algorithms., и . IJCAI, стр. 4210-4212. IJCAI/AAAI Press, (2016)Learning Simple Auctions., и . COLT, том 49 из JMLR Workshop and Conference Proceedings, стр. 1298-1318. JMLR.org, (2016)How Hard is Inference for Structured Prediction?, , , и . ICML, том 37 из JMLR Workshop and Conference Proceedings, стр. 2181-2190. JMLR.org, (2015)How unfair is optimal routing?. SODA, стр. 203-204. ACM/SIAM, (2002)The Price of Anarchy in Auctions, , и . (2016)cite arxiv:1607.07684.