Spremljaj
Rucha Kulkarni
Naslov
Navedeno
Navedeno
Leto
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
562023
Indivisible mixed manna: On the computability of MMS+ PO allocations
R Kulkarni, R Mehta, S Taki
Proceedings of the 22nd ACM Conference on Economics and Computation, 683-684, 2021
28*2021
Octahedral Tucker is PPA-complete
X Deng, Z Feng, R Kulkarni
Electronic Colloquium on Computational Complexity (ECCC) 24, 118, 2017
232017
Smoothed efficient algorithms and reductions for network coordination games
S Boodaghians, R Kulkarni, R Mehta
arXiv preprint arXiv:1809.02280, 2018
20*2018
Dynamic data-race detection through the fine-grained lens
R Kulkarni, U Mathur, A Pavlogiannis
arXiv preprint arXiv:2107.03569, 2021
82021
On the PTAs for maximin shares in an indivisible mixed manna
R Kulkarni, R Mehta, S Taki
Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5523-5530, 2021
52021
Maximin share allocations for assignment valuations
P Kulkarni, R Kulkarni, R Mehta
Proceedings of the International Joint Conference on Autonomous Agents and …, 2023
32023
Fair and Efficient Division of Indivisibles
R Kulkarni
Economics, 2022
12022
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
2024
Approximating APS under Submodular and XOS valuations with Binary Marginals
P Kulkarni, R Kulkarni, R Mehta
arXiv preprint arXiv:2312.08509, 2023
2023
Fair division of indivisibles through the computational lens
RR Kulkarni
University of Illinois at Urbana-Champaign, 2023
2023
Game Theory, Cryptography and Rational Secure Computation
R Kulkarni, A Murhekar
2021
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–12