Author of the publication

Stackelberg thresholds in network routing games or the value of altruism.

, and . EC, page 93-102. ACM, (2007)

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

Regret Bounds for Sleeping Experts and Bandits., , and . COLT, page 425-436. Omnipress, (2008)Characterizing truthful multi-armed bandit mechanisms: extended abstract., , and . EC, page 79-88. ACM, (2009)Stackelberg thresholds in network routing games or the value of altruism., and . Games and Economic Behavior, 67 (1): 174-190 (2009)Regret bounds for sleeping experts and bandits., , and . Machine Learning, 80 (2-3): 245-272 (2010)Characterizing Truthful Multi-Armed Bandit Mechanisms, , and . CoRR, (2008)Stackelberg thresholds in network routing games or the value of altruism., and . EC, page 93-102. ACM, (2007)Approximation algorithms for prize collecting forest problems with submodular penalty functions., , and . SODA, page 1275-1284. SIAM, (2007)Characterizing Truthful Multi-armed Bandit Mechanisms., , and . SIAM J. Comput., 43 (1): 194-230 (2014)Wormhole: Reliable Pub-Sub to Support Geo-replicated Internet Services., , , , , , , , , and 12 other author(s). NSDI, page 351-366. USENIX Association, (2015)Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements., , and . WAOA, volume 5426 of Lecture Notes in Computer Science, page 174-187. Springer, (2008)