Follow
Bhaskar Ray Chaudhury
Title
Cited by
Cited by
Year
EFX exists for three agents
BR Chaudhury, J Garg, K Mehlhorn
Journal of the ACM 71 (1), 1-27, 2024
1362024
A little charity guarantees almost envy-freeness
BR Chaudhury, T Kavitha, K Mehlhorn, A Sgouritsa
SIAM Journal on Computing 50 (4), 1336-1358, 2021
1132021
Improving EFX guarantees through rainbow cycle number
BR Chaudhury, J Garg, K Mehlhorn, R Mehta, P Misra
Proceedings of the 22nd ACM Conference on Economics and Computation, 310-311, 2021
482021
Fair and efficient allocations under subadditive valuations
BR Chaudhury, J Garg, R Mehta
Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5269-5276, 2021
402021
On fair division of indivisible items
B Chaudhury, YK Cheung, J Garg, N Garg, M Hoefer, K Mehlhorn
arXiv preprint arXiv:1805.06232, 2018
382018
Competitive allocation of a mixed manna
BR Chaudhury, J Garg, P McGlaughlin, R Mehta
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
282021
EFX allocations: Simplifications and improvements
H Akrami, N Alon, BR Chaudhury, J Garg, K Mehlhorn, R Mehta
arXiv preprint arXiv:2205.07638, 2022
252022
Polyline simplification has cubic complexity
K Bringmann, BR Chaudhury
arXiv preprint arXiv:1810.00621, 2018
202018
Fairness in federated learning via core-stability
B Ray Chaudhury, L Li, M Kang, B Li, R Mehta
Advances in neural information processing systems 35, 5738-5750, 2022
192022
Maximizing Nash social welfare in 2-value instances
H Akrami, BR Chaudhury, M Hoefer, K Mehlhorn, M Schmalhofer, ...
Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 4760-4767, 2022
172022
Dividing bads is harder than dividing goods: On the complexity of fair and efficient division of chores
BR Chaudhury, J Garg, P McGlaughlin, R Mehta
arXiv preprint arXiv:2008.00285, 2020
172020
Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores∗
S Boodaghians, BR Chaudhury, R Mehta
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
162022
Sketching, streaming, and fine-grained complexity of (weighted) LCS
K Bringmann, BR Chaudhury
arXiv preprint arXiv:1810.01238, 2018
152018
EFX: a simpler approach and an (almost) optimal guarantee via rainbow cycle number
H Akrami, N Alon, BR Chaudhury, J Garg, K Mehlhorn, R Mehta
Proceedings of the 24th ACM Conference on Economics and Computation, 61-61, 2023
132023
Competitive equilibrium with chores: Combinatorial algorithm and hardness
BR Chaudhury, J Garg, P McGlaughlin, R Mehta
Proceedings of the 23rd ACM Conference on Economics and Computation, 1106-1107, 2022
112022
Fair division of indivisible goods for a class of concave valuations
BR Chaudhury, YK Cheung, J Garg, N Garg, M Hoefer, K Mehlhorn
Journal of Artificial Intelligence Research 74, 111-142, 2022
62022
On the existence of competitive equilibrium with chores
BR Chaudhury, J Garg, P McGlaughlin, R Mehta
13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022
52022
A complementary pivot algorithm for competitive allocation of a mixed manna
BR Chaudhury, J Garg, P McGlaughlin, R Mehta
Mathematics of Operations Research 48 (3), 1630-1656, 2023
42023
Incentives in federated learning: Equilibria, dynamics, and mechanisms for welfare maximization
A Murhekar, Z Yuan, B Ray Chaudhury, B Li, R Mehta
Advances in Neural Information Processing Systems 36, 2024
32024
Maximizing Nash social welfare in 2-value instances: the half-integer case
H Akrami, B Ray Chaudhury, M Hoefer, K Mehlhorn, M Schmalhofer, ...
arXiv preprint arXiv:2207.10949, 2022
22022
The system can't perform the operation now. Try again later.
Articles 1–20