Follow
Bhaskar Ray Chaudhury
Title
Cited by
Cited by
Year
EFX exists for three agents
BR Chaudhury, J Garg, K Mehlhorn
Proceedings of the 21st ACM Conference on Economics and Computation, 1-19, 2020
622020
A little charity guarantees almost envy-freeness
BR Chaudhury, T Kavitha, K Mehlhorn, A Sgouritsa
SIAM Journal on Computing 50 (4), 1336-1358, 2021
602021
On Fair Division of Indivisible Items
B Chaudhury, YK Cheung, J Garg, N Garg, M Hoefer, K Mehlhorn
arXiv preprint arXiv:1805.06232, 2018
312018
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
232021
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
192021
Polyline simplification has cubic complexity
K Bringmann, BR Chaudhury
arXiv preprint arXiv:1810.00621, 2018
192018
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
162021
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
92020
Sketching, streaming, and fine-grained complexity of (weighted) LCS
K Bringmann, BR Chaudhury
arXiv preprint arXiv:1810.01238, 2018
92018
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
62022
On fair division of indivisible items
YK Cheung, B Chaudhuri, J Garg, N Garg, M Hoefer, K Mehlhorn
CoRR abs/1805.06232, 2018
52018
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
32022
Nash social welfare for 2-value instances
H Akrami, BR Chaudhury, K Mehlhorn, G Shahkarami, Q Vermande
arXiv preprint arXiv:2106.14816, 2021
22021
Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness
BR Chaudhury, J Garg, P McGlaughlin, R Mehta
arXiv preprint arXiv:2205.11363, 2022
12022
EFX Allocations: Simplifications and Improvements
H Akrami, BR Chaudhury, J Garg, K Mehlhorn, R Mehta
arXiv preprint arXiv:2205.07638, 2022
12022
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
12022
Combinatorial Algorithms for General Linear Arrow-Debreu Markets
BR Chaudhury, K Mehlhorn
arXiv preprint arXiv:1810.01237, 2018
12018
Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case
H Akrami, BR Chaudhury, M Hoefer, K Mehlhorn, M Schmalhofer, ...
arXiv preprint arXiv:2207.10949, 2022
2022
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
2022
On the Existence of EFX Allocations
BR Chaudhury
International Workshop on Combinatorial Algorithms, 21-27, 2022
2022
The system can't perform the operation now. Try again later.
Articles 1–20