Homepage
Contact
Bhaskar Ray Chaudhury
Max-Planck-Institut für InformatikDepartment 1: Algorithms and Complexity
| office: |
Campus E1 4,
Room 309 Saarland Informatics Campus 66123 Saarbrücken Germany |
| email: | braycha@mpi-inf.mpg.de |
| phone: | +49 681 9325-1009 |
Research Interests
- Fair Division
- Combinatorial Algorithms for Market Equilibria
- Fine Grained Complexity
- Computational Geometry
Publications
- Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores
Shant Boodaghians, Bhaskar Ray Chaudhury, Ruta Mehta
- Nash Social Welfare for 2-value Instances
Hannaneh Akrami, Bhaskar Ray Chaudhury, Kurt Mehlhorn, Golnoosh Shahkarami, Quentin Vermande
- Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores
Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta
- Improving EFX Guarantees through Rainbow Cycle Number
Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra
( To appear ) Proc. of the 22nd ACM Conference on Economics and Computation ( EC 2021 )
- Fair and Efficient Allocations under Subadditive Valuations
Bhaskar Ray Chaudhury, Jugal Garg, Ruta Mehta
( To appear ) Proc. of the 35th AAAI Conference on Artificial Intelligence ( AAAI 2021 )
- Competitive Allocation of a Mixed Manna
Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta
Proc. of the 32nd Symposium on Discrete Algorithms ( SODA 2021 )
- EFX Exists for Three Agents
Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn
Proc. of the 21st ACM Conference on Economics and Computation ( EC 2020 )
Best Student Paper Award
Exemplary Paper in the Theory Track Award
- A Little Charity Guarantees Almost Envy-Freeness
Bhaskar Ray Chaudhury, Tellikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
Proc. of the 31st Symposium on Discrete Algorithms ( SODA 2020 )
Full version to appear in SICOMP
- Polyline Simplification has Cubic Complexity
Karl Bringmann, Bhaskar Ray Chaudhury
Proc. of the 35th Symposium on Computational Geometry ( SoCG 2019 )
Invited to JoCG special issue
- Sketching, Streaming and Fine-Grained Complexity of (Weighted) LCS
Karl Bringmann, Bhaskar Ray Chaudhury
Proc. of the 38th Foundations of Software Technology and Theoretical Computer Science ( FSTTCS 2018 )
- Combinatorial Algorithms for General Linear Arrow-Debreu Markets
Bhaskar Ray Chaudhury, Kurt Mehlhorn
Proc. of the 38th Foundations of Software Technology and Theoretical Computer Science ( FSTTCS 2018 )
- On Fair Division of Indivisible Items
Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn
Proc. of the 38th Foundations of Software Technology and Theoretical Computer Science ( FSTTCS 2018 )
Invited Talks
- On the Existence of EFX Allocations
(Invited Talk) Workshop on Fair Resource Allocation: Concepts, Algorithms and Complexity ( EC 2021 )
- Discrete Fair Division
Colloqium Talk at University of Illinois at Urbana-Champaign
Part of the Illinois Computer Science Speakers Series
- On the Existence of EFX Allocations
Colloqium Talk at University of Cologne
- Towards Efficient Almost Envy-Free Allocations
Workshop on Complexity in Algorithmic Game theory at the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), IIT Bombay
Teaching
- Summer 2020
Co-organizer (Reading Group in Algorithms)
- Winter 2019-2020
Co-organizer (Topics in Fair Division)
- Summer 2019
Co-organizer (Reading Group Algorithms)
- Winter 2017-2018
Tutor (Algorithms and Data Structures)
- Winter 2017-2018
Tutor (Algorithmic Game Theory, Mechanism Design and Computational Economics )
- Winter 2016-2017
Tutor (Algorithms and Data Structures)
Education
- June 2017 - present:
Ph. D. student in Computer Science at Universität des Saarlandes and Max-Planck-Institut für Informatik, Germany
- October 2015 - March 2017:
Graduate School of Computer Science, Saarbruecken