1 citations · 2 across the 3 of their papers we have counts for
6 papers · 1 filter
Single-or-Sample: Online Fair Allocation for Combinatorial Agents
Shuchi Chawla, Zhiyi Huang, Pooja Kulkarni +2
We study the problem of fairly allocating indivisible goods among agents who arrive online, under the notion of maximin share (MMS) fairness. Fair allocation with online ar…
Cycle Cancellation for Submodular Fractional Allocations and Applications
Chandra Chekuri, Pooja Kulkarni, Ruta Mehta +1
We consider discrete allocation problem where indivisible goods are to be divided among agents. When agents' valuations are additive, the well-known cycle cancelling lemma…
Online Fair Division With Subsidy: When Do Envy-Free Allocations Exist, and at What Cost?
Pooja Kulkarni, Ruta Mehta, Vishnu V. Narayan +1
We study the problem of fairly allocating indivisible items arriving online, among (offline) agents. Although envy-freeness has emerged as the archetypal fairness notion, e…
Online Fair Division: Towards Ex-Post Constant MMS Guarantees
Pooja Kulkarni, Ruta Mehta, Parnian Shahkar
We investigate the problem of fairly allocating indivisible items among sequentially arriving agents with additive valuations, under the sought-after fairness notion of max…
Approximating APS under Submodular and XOS valuations with Binary Marginals
Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta
We study the problem of fairly dividing indivisible goods among a set of agents under the fairness notion of Any Price Share (APS). APS is known to dominate the widely studied Maxi…
1/2 Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations
Chandra Chekuri, Pooja Kulkarni, Rucha Kulkarni +1
We study fair distribution of a collection of m indivisible goods among a group of n agents, using the widely recognized fairness principles of Maximin Share (MMS) and Any Price Sh…