conftrace_

envy-free allocation

46 papers

Explore in graph

Co-occurring keywords

fair division (158) approximation algorithm (630) combinatorial optimization (1039) indivisible good (46) fair allocation (73) resource allocation (251) efx allocation (12) proportional allocation (14) cake cutting (14) polynomial-time algorithm (39)

Papers

Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations IJCAI 2022
Envy-Free and Pareto-Optimal Allocations for Agents with Asymmetric Random Valuations IJCAI 2022
I Will Have Order! Optimizing Orders for Fair Reviewer Assignment IJCAI 2022
Envy-free Policy Teaching to Multiple Agents NIPS 2022
Dynamic Fair Division with Partial Information NIPS 2022
Fair Equilibria in Sponsored Search Auctions: The Advertisers’ Perspective IJCAI 2022
The Query Complexity of Cake Cutting NIPS 2022
Approximately EFX Allocations for Indivisible Chores IJCAI 2022
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings AAAI 2021
Budget-feasible Maximum Nash Social Welfare is Almost Envy-free IJCAI 2021
Maximum Nash Welfare and Other Stories About EFX IJCAI 2020
Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination AAAI 2020
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms AAAI 2020
Fair Division of Time: Multi-layered Cake Cutting IJCAI 2020
Maximin-Aware Allocations of Indivisible Goods IJCAI 2019
When Do Envy-Free Allocations Exist? AAAI 2019
Matroid Constrained Fair Allocation Problem AAAI 2019
Fair Division with a Secretive Agent AAAI 2019
Dynamic Fair Division Problem with General Valuations IJCAI 2018
Which is the Fairest (Rent Division) of Them All? [Extended Abstract] IJCAI 2017
Cake Cutting: Envy and Truth IJCAI 2017