1 citations · 1 across the 9 of their papers we have counts for
11 papers
The Landscape of Almost Equitable Allocations
Hadi Hosseini, Vishwa Prakash HV, Aditi Sethia +1
Equitability is a fundamental notion in fair division which requires that all agents derive equal value from their allocated bundles. We study, for general (possibly non-monotone)…
Fair Societies: Algorithms for House Allocations
Hadi Hosseini, Sanjukta Roy, Aditi Sethia
House Allocations concern with matchings involving one-sided preferences, where houses serve as a proxy encoding valuable indivisible resources (e.g. organs, course seats, subsidiz…
Fair and Efficient Allocation of Indivisible Mixed Manna
Siddharth Barman, Vishwa Prakash HV, Aditi Sethia +1
We study fair division of indivisible mixed manna (items whose values may be positive, negative, or zero) among agents with additive valuations. Here, we establish that fairness --…
Best of Both Worlds Guarantees for Equitable Allocations
Umang Bhaskar, Vishwa Prakash HV, Aditi Sethia +1
Equitability is a well-studied fairness notion in fair division, where an allocation is equitable if all agents receive equal utility from their allocation. For indivisible items,…
Exact Maximin Share Fairness via Adjusted Supply
Siddharth Barman, Satyanand Rammohan, Aditi Sethia
This work addresses fair allocation of indivisible items in settings wherein it is feasible to create copies of resources or dispose of tasks. We establish that exact maximin share…
Equitable Allocations of Mixtures of Goods and Chores
Hadi Hosseini, Aditi Sethia
Equitable allocation of indivisible items involves partitioning the items among agents such that everyone derives (almost) equal utility. We consider the approximate notion of \tex…
Envy-Free and Efficient Allocations for Graphical Valuations
Neeldhara Misra, Aditi Sethia
We consider the complexity of finding envy-free allocations for the class of graphical valuations. Graphical valuations were introduced by Christodoulou et. al.(2023) as a structur…
The Cost and Complexity of Minimizing Envy in House Allocation
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
We study almost-envy-freeness in house allocation, where houses are to be allocated among agents so that every agent receives exactly one house. An envy-free allocation nee…
The Price of Equity with Binary Valuations and Few Agent Types
Umang Bhaskar, Neeldhara Misra, Aditi Sethia +1
In fair division problems, the notion of price of fairness measures the loss in welfare due to a fairness constraint. Prior work on the price of fairness has focused primarily on e…
Finding and Counting Patterns in Sparse Graphs
Balagopal Komarath, Anant Kumar, Suchismita Mishra +1
We consider algorithms for finding and counting small, fixed graphs in sparse host graphs. In the non-sparse setting, the parameters treedepth and treewidth play a crucial role in…
Red-Blue Point Separation for Points on a Circle
Neeldhara Misra, Harshil Mittal, Aditi Sethia
Given a set R of red points and a set B of blue points in the plane, the Red-Blue point separation problem asks if there are at most k lines that separate R from B, that is, each c…