Bhaskar Ray Chaudhury | DeepAI

AI Chat

Featured Co-authors

Bo Li
461 publications
Karl Bringmann
49 publications
Jugal Garg
28 publications
Ruta Mehta
25 publications
Kurt Mehlhorn
21 publications
Linyi Li
21 publications
Martin Hoefer
19 publications
Hannaneh Akrami
11 publications
Pranabendu Misra
10 publications
Golnoosh Shahkarami
9 publications
Shant Boodaghians
8 publications

∙ 05/08/2023

Fair and Efficient Allocation of Indivisible Chores with Surplus

We study fair division of indivisible chores among n agents with additiv...

0 Hannaneh Akrami, et al. ∙

∙ 11/03/2022

Fairness in Federated Learning via Core-Stability

Federated learning provides an effective paradigm to jointly optimize a ...

0 Bhaskar Ray Chaudhury, et al. ∙

∙ 07/22/2022

Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case

We consider the problem of maximizing the Nash social welfare when alloc...

0 Hannaneh Akrami, et al. ∙

∙ 05/23/2022

Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness

We study the computational complexity of finding a competitive equilibri...

0 Bhaskar Ray Chaudhury, et al. ∙

∙ 05/16/2022

EFX Allocations: Simplifications and Improvements

The existence of EFX allocations is a fundamental open problem in discre...

0 Hannaneh Akrami, et al. ∙

∙ 07/19/2021

Maximizing Nash Social Welfare in 2-Value Instances

We consider the problem of maximizing the Nash social welfare when alloc...

0 Hannaneh Akrami, et al. ∙

∙ 07/12/2021

Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores

Competitive equilibrium with equal income (CEEI) is considered one of th...

0 Shant Boodaghians, et al. ∙

∙ 06/28/2021

Nash Social Welfare for 2-value Instances

We study the problem of allocating a set of indivisible goods among agen...

0 Hannaneh Akrami, et al. ∙

∙ 03/02/2021

Improving EFX Guarantees through Rainbow Cycle Number

We study the problem of fairly allocating a set of indivisible goods amo...

0 Bhaskar Ray Chaudhury, et al. ∙

∙ 08/06/2020

Competitive Allocation of a Mixed Manna

We study the fair division problem of allocating a mixed manna under add...

0 Bhaskar Ray Chaudhury, et al. ∙

∙ 08/01/2020

Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores

We study the chore division problem where a set of agents needs to divid...

0 Bhaskar Ray Chaudhury, et al. ∙

∙ 05/13/2020

Fair and Efficient Allocations under Subadditive Valuations

We study the problem of allocating a set of indivisible goods among agen...

0 Bhaskar Ray Chaudhury, et al. ∙

∙ 02/12/2020

EFX Exists for Three Agents

We study the problem of allocating a set of indivisible items among agen...

0 Bhaskar Ray Chaudhury, et al. ∙

∙ 07/10/2019

A Little Charity Guarantees Almost Envy-Freeness

Fair division of indivisible goods is a very well-studied problem. The g...

0 Bhaskar Ray Chaudhury, et al. ∙

∙ 10/02/2018

Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS

We study sketching and streaming algorithms for the Longest Common Subse...

0 Karl Bringmann, et al. ∙

∙ 10/02/2018

Combinatorial Algorithms for General Linear Arrow-Debreu Markets

We present a combinatorial algorithm for determining the market clearing...

0 Bhaskar Ray Chaudhury, et al. ∙

∙ 10/01/2018

Polyline Simplification has Cubic Complexity

In the classic polyline simplification problem we want to replace a give...

0 Karl Bringmann, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world