( en | de | ru )

 

Disambiguation of "Roughgarden, Tim"

Author of the publication

copydeleteadd this publication to your clipboard
From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders

, , and . CoRR, (2011)

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.

Tim Mattern

Regeneration der Grünlandnarbe nach Winterbeweidung mit Rindern. Uni Gießen, (2009)

Friedel Timmermann

Jörg Frithjof Timm

Klaus Timm

Karla Timm

 

Other publications of authors with the same name

Braess's paradox in large random graphs., and . EC, page 296-305. ACM, (2006)The Price of Anarchy in Auctions, , and . (2016)cite arxiv:1607.07684.Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation)., , and . SPAA, page 1-12. ACM, (2016)The Price of Anarchy in Auctions., , and . CoRR, (2016)From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders, , and . CoRR, (2011)Worst-Case Efficiency Analysis of Queueing Disciplines., and . ICALP (2), volume 5556 of Lecture Notes in Computer Science, page 546-557. Springer, (2009)Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability., , , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 497-512. Springer, (2005)Optimal Efficiency Guarantees for Network Design Mechanisms., and . IPCO, volume 4513 of Lecture Notes in Computer Science, page 469-483. Springer, (2007)How unfair is optimal routing?. SODA, page 203-204. ACM/SIAM, (2002)Bertrand Competition in Networks., and . SAGT, volume 4997 of Lecture Notes in Computer Science, page 70-82. Springer, (2008)