Sledovat
Pooja Kulkarni
Název
Citace
Citace
Rok
Approximating Nash social welfare under submodular valuations through (un) matchings
J Garg, P Kulkarni, R Kulkarni
ACM Transactions on Algorithms 19 (4), 1-25, 2023
662023
Fair division of indivisible goods among strategic agents
S Barman, G Ghalme, S Jain, P Kulkarni, S Narang
arXiv preprint arXiv:1901.09427, 2019
432019
Sublinear approximation algorithm for Nash social welfare with XOS valuations
S Barman, A Krishna, P Kulkarni, S Narang
arXiv preprint arXiv:2110.00767, 2021
122021
On fair and efficient allocations of indivisible public goods
J Garg, P Kulkarni, A Murhekar
arXiv preprint arXiv:2107.09871, 2021
102021
Maximin share allocations for assignment valuations
P Kulkarni, R Kulkarni, R Mehta
Proceedings of the International Joint Conference on Autonomous Agents and …, 2023
72023
Approximation algorithms for envy-free cake division with connected pieces
S Barman, P Kulkarni
arXiv preprint arXiv:2208.08670, 2022
42022
1/2-approximate MMS allocation for separable piecewise linear concave valuations
C Chekuri, P Kulkarni, R Kulkarni, R Mehta
Proceedings of the AAAI Conference on Artificial Intelligence 38 (9), 9590-9597, 2024
32024
50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
AR Karlin, R Kyng, P Baumann, M Ganardi, R Majumdar, RS Thinniyam, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2023
32023
LIPIcs, Volume 287, ITCS 2024, Complete Volume}}
V Guruswami, S Aaronson, H Buhrman, W Kretschmer, S Aaronson, ...
15th Innovations in Theoretical Computer Science Conference (ITCS 2024) 287, 0, 2024
2024
Approximating APS under Submodular and XOS valuations with Binary Marginals
P Kulkarni, R Kulkarni, R Mehta
arXiv preprint arXiv:2312.08509, 2023
2023
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–10