default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBhaskar Ray Chaudhury
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Bhaskar Ray Chaudhury
, Jugal Garg, Kurt Mehlhorn:
EFX Exists for Three Agents. J. ACM 71(1): 4:1-4:27 (2024)- [c19]Bhaskar Ray Chaudhury, Aniket Murhekar, Zhuowen Yuan, Bo Li, Ruta Mehta, Ariel D. Procaccia:
Fair Federated Learning via the Proportional Veto Core. ICML 2024 - [i17]Bhaskar Ray Chaudhury, Christian Kroer, Ruta Mehta, Tianlong Nan:
Competitive Equilibrium for Chores: from Dual Eisenberg-Gale to a Fast, Greedy, LP-based Algorithm. CoRR abs/2402.10439 (2024) - 2023
- [j4]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna. Math. Oper. Res. 48(3): 1630-1656 (2023) - [c18]Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
Fair and Efficient Allocation of Indivisible Chores with Surplus. IJCAI 2023: 2494-2502 - [c17]Aniket Murhekar, Zhuowen Yuan, Bhaskar Ray Chaudhury, Bo Li, Ruta Mehta:
Incentives in Federated Learning: Equilibria, Dynamics, and Mechanisms for Welfare Maximization. NeurIPS 2023 - [c16]Hannaneh Akrami, Noga Alon, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number. EC 2023: 61 - [i16]Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
Fair and Efficient Allocation of Indivisible Chores with Surplus. CoRR abs/2305.04788 (2023) - 2022
- [j3]Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn:
Fair Division of Indivisible Goods for a Class of Concave Valuations. J. Artif. Intell. Res. 74: 111-142 (2022) - [c15]Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer, Kurt Mehlhorn, Marco Schmalhofer, Golnoosh Shahkarami, Giovanna Varricchio, Quentin Vermande, Ernest van Wijland:
Maximizing Nash Social Welfare in 2-Value Instances. AAAI 2022: 4760-4767 - [c14]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
On the Existence of Competitive Equilibrium with Chores. ITCS 2022: 41:1-41:13 - [c13]Bhaskar Ray Chaudhury:
On the Existence of EFX Allocations. IWOCA 2022: 21-27 - [c12]Bhaskar Ray Chaudhury, Linyi Li, Mintong Kang, Bo Li, Ruta Mehta:
Fairness in Federated Learning via Core-Stability. NeurIPS 2022 - [c11]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness. EC 2022: 1106-1107 - [c10]Shant Boodaghians, Bhaskar Ray Chaudhury, Ruta Mehta:
Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores. SODA 2022: 2285-2302 - [i15]Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
EFX Allocations: Simplifications and Improvements. CoRR abs/2205.07638 (2022) - [i14]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness. CoRR abs/2205.11363 (2022) - [i13]Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer, Kurt Mehlhorn, Marco Schmalhofer, Golnoosh Shahkarami, Giovanna Varricchio, Quentin Vermande, Ernest van Wijland:
Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case. CoRR abs/2207.10949 (2022) - [i12]Bhaskar Ray Chaudhury, Linyi Li, Mintong Kang, Bo Li, Ruta Mehta:
Fairness in Federated Learning via Core-Stability. CoRR abs/2211.02091 (2022) - 2021
- [b1]Bhaskar Ray Chaudhury:
Finding fair and efficient allocations. Saarland University, Germany, 2021 - [j2]Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa:
A Little Charity Guarantees Almost Envy-Freeness. SIAM J. Comput. 50(4): 1336-1358 (2021) - [c9]Bhaskar Ray Chaudhury, Jugal Garg, Ruta Mehta:
Fair and Efficient Allocations under Subadditive Valuations. AAAI 2021: 5269-5276 - [c8]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra:
Improving EFX Guarantees through Rainbow Cycle Number. EC 2021: 310-311 - [c7]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Competitive Allocation of a Mixed Manna. SODA 2021: 1405-1424 - [i11]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra:
Improving EFX Guarantees through Rainbow Cycle Number. CoRR abs/2103.01628 (2021) - [i10]Hannaneh Akrami, Bhaskar Ray Chaudhury, Kurt Mehlhorn, Golnoosh Shahkarami, Quentin Vermande:
Nash Social Welfare for 2-value Instances. CoRR abs/2106.14816 (2021) - [i9]Shant Boodaghians, Bhaskar Ray Chaudhury, Ruta Mehta:
Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores. CoRR abs/2107.06649 (2021) - 2020
- [j1]Karl Bringmann, Bhaskar Ray Chaudhury:
Polyline simplification has cubic complexity. J. Comput. Geom. 11(2): 94-130 (2020) - [c6]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn:
EFX Exists for Three Agents. EC 2020: 1-19 - [c5]Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa:
A Little Charity Guarantees Almost Envy-Freeness. SODA 2020: 2658-2672 - [i8]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn:
EFX Exists for Three Agents. CoRR abs/2002.05119 (2020) - [i7]Bhaskar Ray Chaudhury, Jugal Garg, Ruta Mehta:
Fair and Efficient Allocations under Subadditive Valuations. CoRR abs/2005.06511 (2020) - [i6]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores. CoRR abs/2008.00285 (2020) - [i5]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Competitive Allocation of a Mixed Manna. CoRR abs/2008.02753 (2020)
2010 – 2019
- 2019
- [c4]Karl Bringmann, Bhaskar Ray Chaudhury:
Polyline Simplification has Cubic Complexity. SoCG 2019: 18:1-18:16 - [i4]Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa:
A Little Charity Guarantees Almost Envy-Freeness. CoRR abs/1907.04596 (2019) - 2018
- [c3]Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn:
On Fair Division for Indivisible Items. FSTTCS 2018: 25:1-25:17 - [c2]Bhaskar Ray Chaudhury, Kurt Mehlhorn:
Combinatorial Algorithms for General Linear Arrow-Debreu Markets. FSTTCS 2018: 26:1-26:16 - [c1]Karl Bringmann, Bhaskar Ray Chaudhury:
Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS. FSTTCS 2018: 40:1-40:16 - [i3]Karl Bringmann, Bhaskar Ray Chaudhury:
Polyline Simplification has Cubic Complexity. CoRR abs/1810.00621 (2018) - [i2]Bhaskar Ray Chaudhury, Kurt Mehlhorn:
Combinatorial Algorithms for General Linear Arrow-Debreu Markets. CoRR abs/1810.01237 (2018) - [i1]Karl Bringmann, Bhaskar Ray Chaudhury:
Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS. CoRR abs/1810.01238 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 00:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
