Author of the publication

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.

 

Other publications of authors with the same name

How unfair is optimal routing?. SODA, page 203-204. ACM/SIAM, (2002)The Price of Anarchy in Auctions, , and . (2016)cite arxiv:1607.07684.From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders, , and . CoRR, (2011)The Price of Anarchy in Auctions., , and . CoRR, (2016)Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation)., , and . SPAA, page 1-12. ACM, (2016)Learning Simple Auctions., and . COLT, volume 49 of JMLR Workshop and Conference Proceedings, page 1298-1318. JMLR.org, (2016)Why Prices Need Algorithms., and . IJCAI, page 4210-4212. IJCAI/AAAI Press, (2016)Braess's paradox in large random graphs., and . EC, page 296-305. ACM, (2006)Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability., , , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 497-512. Springer, (2005)Worst-Case Efficiency Analysis of Queueing Disciplines., and . ICALP (2), volume 5556 of Lecture Notes in Computer Science, page 546-557. Springer, (2009)