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.

 

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

Nash Social Welfare in Selfish and Online Load Balancing., , , и . WINE, том 12495 из Lecture Notes in Computer Science, стр. 323-337. Springer, (2020)Non-Atomic One-Round Walks in Polynomial Congestion Games.. ICTCS, том 1720 из CEUR Workshop Proceedings, стр. 11-22. CEUR-WS.org, (2016)Inequity Aversion Pricing in Multi-Unit Markets., , , и . ECAI, том 325 из Frontiers in Artificial Intelligence and Applications, стр. 91-98. IOS Press, (2020)Congestion Games with Priority-Based Scheduling., и . SAGT, том 12283 из Lecture Notes in Computer Science, стр. 67-82. Springer, (2020)General Opinion Formation Games with Social Group Membership., , и . IJCAI, стр. 88-94. ijcai.org, (2022)Almost Envy-Free Allocations with Connected Bundles., , , , , , , и . ITCS, том 124 из LIPIcs, стр. 14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies., , и . ICALP, том 198 из LIPIcs, стр. 59:1-59:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback., , и . AAAI, стр. 12069-12077. AAAI Press, (2021)The Price of Anarchy of Affine Congestion Games with Similar Strategies., и . ICTCS, том 2243 из CEUR Workshop Proceedings, стр. 48-59. CEUR-WS.org, (2018)Nash Social Welfare in Selfish and Online Load Balancing., , , и . ICTCS, том 3284 из CEUR Workshop Proceedings, стр. 180-187. CEUR-WS.org, (2022)