Author of the publication

Welfare Maximization with Friends-of-Friends Network Externalities.

, , , and . STACS, volume 30 of LIPIcs, page 90-102. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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

Tight Bounds for Online Graph Partitioning., , , and . CoRR, (2020)Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives., , , and . Formal Methods Syst. Des., 42 (3): 301-327 (2013)Algorithms and Hardness for Diameter in Dynamic Graphs., , , , and . CoRR, (2018)Deterministic Dynamic Matching in O(1) Update Time., , and . Algorithmica, 82 (4): 1057-1080 (2020)New deterministic approximation algorithms for fully dynamic matching., , and . STOC, page 398-411. ACM, (2016)On Multiple Round Sponsored Search Auctions with Budgets, , , and . CoRR, (2011)A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths., , and . SODA, page 1053-1072. SIAM, (2014)Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification., and . SODA, page 1318-1336. SIAM, (2011)Tight Bounds for Online Graph Partitioning., , , and . SODA, page 2799-2818. SIAM, (2021)New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners., , , , and . SODA, page 1836-1855. SIAM, (2021)