6 citations · 6 across the 2 of their papers we have counts for
6 papers
Competitive Allocation of a Mixed Manna
Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin +1
We study the fair division problem of allocating a mixed manna under additively separable piecewise linear concave (SPLC) utilities. A mixed manna contains goods that everyone like…
Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores
Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin +1
We study the chore division problem where a set of agents needs to divide a set of chores (bads) among themselves fairly and efficiently. We assume that agents have linear disutili…
Fair and Efficient Allocations under Subadditive Valuations
Bhaskar Ray Chaudhury, Jugal Garg, Ruta Mehta
We study the problem of allocating a set of indivisible goods among agents with subadditive valuations in a fair and efficient manner. Envy-Freeness up to any good (EFX) is the mos…
EFX Exists for Three Agents
Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn
We study the problem of distributing a set of indivisible items among agents with additive valuations in a manner. The fairness notion under consideration is Envy-f…
A Little Charity Guarantees Almost Envy-Freeness
Bhaskar Ray Chaudhury, Tellikepalli Kavitha, Kurt Mehlhorn +1
Fair division of indivisible goods is a very well-studied problem. The goal of this problem is to distribute goods to agents in a "fair" manner, where every agent has a val…
Let's HPC: A web-based interactive platform to aid High Performance Computing education
Akshar Varma, Yashwant Keswani, Yashodhan Bhatnagar +1
Let's HPC (www.letshpc.org) is an open-access online platform to supplement conventional classroom oriented High Performance Computing (HPC) and Parallel & Distributed Computing (P…