research
∙
08/29/2023
Efficient Almost-Egalitarian Allocation of Goods and Bads
We consider the allocation of indivisible objects among agents with diff...
share
research
∙
05/17/2023
Balanced Donor Coordination
Charity is typically done either by individual donors, who donate money ...
research
∙
03/22/2023
Leximin Approximation: From Single-Objective to Multi-Objective
Leximin is a common approach to multi-objective optimization, frequently...
research
∙
03/04/2023
On Maximum Bipartite Matching with Separation
Maximum bipartite matching is a fundamental algorithmic problem which ca...
research
∙
02/09/2023
A Reduction from Chores Allocation to Job Scheduling
We consider allocating indivisible chores among agents with different co...
research
∙
01/22/2023
Cutting a Cake Fairly for Groups Revisited
Cake cutting is a classic fair division problem, with the cake serving a...
research
∙
05/28/2022
Fair Division Algorithms for Electricity Distribution
In many developing countries, the total electricity demand is larger tha...
research
∙
05/16/2022
Efficient Nearly-Fair Division with Capacity Constraints
We consider the problem of fairly and efficiently matching agents to ind...
research
∙
04/25/2022
Number Partitioning with Splitting
We consider a variant of the n-way number partitioning problem, in which...
research
∙
01/19/2022
Ordinal Maximin Share Approximation for Chores
We study the problem of fairly allocating a set of m indivisible chores ...
research
∙
12/08/2021
Weighted Fairness Notions for Indivisible Items Revisited
We revisit the setting of fairly allocating indivisible items when agent...
research
∙
10/17/2021
On Monotonicity of Number-Partitioning Algorithms
An algorithm for number-partitioning is called value-monotone if wheneve...
research
∙
09/04/2021
Ordinal Maximin Share Approximation for Goods
In fair division of indivisible goods, l-out-of-d maximin share (MMS) is...
research
∙
05/14/2021
Keep Your Distance: Land Division With Separation
This paper is part of an ongoing endeavor to bring the theory of fair di...
research
∙
05/11/2021
Graphical Cake Cutting via Maximin Share
We study the recently introduced cake-cutting setting in which the cake ...
research
∙
12/12/2020
Mind the Gap: Cake Cutting With Separation
We study the problem of fairly allocating a divisible resource, also kno...
research
∙
12/07/2020
Computing Fair Utilitarian Allocations of Indivisible Goods
We study the computational complexity of computing allocations that are ...
research
∙
10/14/2020
On Fair Division under Heterogeneous Matroid Constraints
We study fair allocation of indivisible goods among additive agents with...
research
∙
01/10/2020
How to Cut a Cake Fairly: A Generalization to Groups
A fundamental result in cake cutting states that for any number of playe...
research
∙
12/31/2019
Generalized Rental Harmony
Rental Harmony is the problem of assigning rooms in a rented house to te...
research
∙
12/31/2019
Quasilinear Rental Harmony
Rental Harmony is the problem of assigning rooms in a rented house to te...
research
∙
12/18/2019
The Maximin Share Dominance Relation
Given a finite set X and an ordering ≽ over its subsets, the l-out-of-d ...
research
∙
12/01/2019
Fair Division with Bounded Sharing
A set of objects is to be divided fairly among agents with different tas...
research
∙
11/19/2019
Strongly Budget Balanced Auctions for Multi-Sided Markets
In two-sided markets, Myerson and Satterthwaite's impossibility theorem ...
research
∙
08/05/2019
Fair Division with Minimal Sharing
A set of objects, some goods and some bads, is to be divided fairly amon...
research
∙
08/01/2019
The Constrained Round Robin Algorithm for Fair and Efficient Allocation
We consider a multi-agent resource allocation setting that models the as...
research
∙
01/28/2019
Bipartite Envy-Free Matching
Bipartite Envy-Free Matching (BEFM) is a relaxation of perfect matching....
research
∙
10/18/2018
Fair Cake-Cutting in Practice
Using a lab experiment, we investigate the real-life performance of envy...
research
∙
04/23/2018
Making an Appraiser Work for You
In many situations, an uninformed agent (UA) needs to elicit information...
research
∙
03/14/2018
Cake-Cutting with Different Entitlements: How Many Cuts are Needed?
A cake has to be divided fairly among n agents. When all agents have equ...
research
∙
12/29/2017
How to Charge Lightning
Off-chain transaction channels represent one of the leading techniques t...
research
∙
12/19/2017
MUDA: A Truthful Multi-Unit Double-Auction Mechanism
In a seminal paper, McAfee (1992) presented a truthful mechanism for dou...
research
∙
11/19/2017
Truthful Bilateral Trade is Impossible even with Fixed Prices
A seminal theorem of Myerson and Satterthwaite (1983) proves that, in a ...
research
∙
09/08/2017
Democratic Fair Allocation of Indivisible Goods
We study the problem of fairly allocating indivisible goods to groups of...
research
∙
09/08/2017
