Skip to content
conftrace_

fair division

160 papers

Papers

Achieving Proportionality up to the Maximin Item with Indivisible Goods AAAI 2021 Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings AAAI 2021 Combining Fairness and Optimality when Selecting and Allocating Projects IJCAI 2021 District-Fair Participatory Budgeting AAAI 2021 Dividing a Graphical Cake AAAI 2021 Equitable and Optimal Transport with Multiple Agents AISTATS 2021 Fair and Efficient Allocations under Lexicographic Preferences AAAI 2021 Fair and Efficient Online Allocations with Normalized Valuations AAAI 2021 Fair and Truthful Mechanisms for Dichotomous Valuations AAAI 2021 Graphical Cake Cutting via Maximin Share IJCAI 2021 Guaranteeing Maximin Shares: Some Agents Left Behind IJCAI 2021 Keep Your Distance: Land Division With Separation IJCAI 2021 Mind the Gap: Cake Cutting With Separation AAAI 2021 Nash Welfare in the Facility Location Problem IJCAI 2021 On Fair Division under Heterogeneous Matroid Constraints AAAI 2021 Online Market Equilibrium with Application to Fair Division NeurIPS 2021 Picking Sequences and Monotonicity in Weighted Fair Division IJCAI 2021 PROPm Allocations of Indivisible Goods to Multiple Agents IJCAI 2021 School Choice with Flexible Diversity Goals and Specialized Seats IJCAI 2021 The Parameterized Complexity of Connected Fair Division IJCAI 2021 The Price of Connectivity in Fair Division AAAI 2021 Two-Sided Matching Meets Fair Division IJCAI 2021 Almost Group Envy-free Allocation of Indivisible Goods and Chores IJCAI 2020 Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types IJCAI 2020 Fair Division of Mixed Divisible and Indivisible Goods AAAI 2020