2024
Topological distance games.
Theor. Comput. Sci., January, 2024
Envy-Free House Allocation with Minimum Subsidy.
CoRR, 2024
Optimal Budget Aggregation with Single-Peaked Preferences.
CoRR, 2024
Weighted Envy-Freeness for Submodular Valuations.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
Fast & Fair: A Collaborative Platform for Fair Division Applications.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
Reachability of Fair Allocations via Sequential Exchanges.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Incentives in social decision schemes with pairwise comparison preferences.
Games Econ. Behav., November, 2023
Fixing knockout tournaments with seeds.
Discret. Appl. Math., November, 2023
Justifying groups in multiwinner approval voting.
Theor. Comput. Sci., August, 2023
On maximum bipartite matching with separation.
Inf. Process. Lett., August, 2023
Keep your distance: Land division with separation.
Comput. Geom., August, 2023
Cutting a Cake Fairly for Groups Revisited.
Am. Math. Mon., March, 2023
Weighted Fair Division with Matroid-Rank Valuations: Monotonicity and Strategyproofness.
CoRR, 2023
Extending the Characterization of Maximum Nash Welfare.
CoRR, 2023
Balanced Donor Coordination.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023
Approximate Envy-Freeness in Graphical Cake Cutting.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
Fair Division with Two-Sided Preferences.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
Settling the Score: Portioning with Cardinal Preferences.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023
Differentially Private Fair Division.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
Approval-Based Voting with Mixed Goods.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
Fairness Concepts for Indivisible Items with Externalities.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
Consensus Halving for Sets of Items.
Math. Oper. Res., November, 2022
Almost envy-freeness for groups: Improved bounds via discrepancy theory.
Theor. Comput. Sci., 2022
The Price of Connectivity in Fair Division.
SIAM J. Discret. Math., 2022
On maximum weighted Nash welfare for binary valuations.
Math. Soc. Sci., 2022
A Characterization of Maximum Nash Welfare for Indivisible Goods.
CoRR, 2022
Mind the gap: Cake cutting with separation.
Artif. Intell., 2022
Margin of victory for tournament solutions.
Artif. Intell., 2022
Generalized kings and single-elimination winners in random tournaments.
Auton. Agents Multi Agent Syst., 2022
Guest editorial: special issue on fair division.
Auton. Agents Multi Agent Syst., 2022
The Price of Justified Representation.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
Weighted Fairness Notions for Indivisible Items Revisited.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
Weighted Envy-freeness in Indivisible Item Allocation.
ACM Trans. Economics and Comput., 2021
How to Cut a Cake Fairly: A Generalization to Groups.
Am. Math. Mon., 2021
Constraints in fair division.
SIGecom Exch., 2021
Fairly Allocating Many Goods with Few Queries.
SIAM J. Discret. Math., 2021
Closing Gaps in Asymptotic Fair Division.
SIAM J. Discret. Math., 2021
On the complexity of fair house allocation.
Oper. Res. Lett., 2021
The Price of Fairness for Indivisible Goods.
Theory Comput. Syst., 2021
Welfare Guarantees in Schelling Segregation.
J. Artif. Intell. Res., 2021
Picking sequences and monotonicity in weighted fair division.
Artif. Intell., 2021
Schelling games on graphs.
Artif. Intell., 2021
Funding Public Projects: A Case for the Nash Product Rule.
Proceedings of the Web and Internet Economics - 17th International Conference, 2021
Tournaments in Computational Social Choice: Recent Developments.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021
Graphical Cake Cutting via Maximin Share.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021
Margin of Victory in Tournaments: Structural and Experimental Results.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
Dividing a Graphical Cake.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
Pricing Multi-Unit Markets.
ACM Trans. Economics and Comput., 2020
Almost envy-freeness in group resource allocation.
Theor. Comput. Sci., 2020
When Do Envy-Free Allocations Exist?
SIAM J. Discret. Math., 2020
Robust bounds on choosing from large tournaments.
Soc. Choice Welf., 2020
Truthful fair division without free disposal.
Soc. Choice Welf., 2020
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms.
J. Artif. Intell. Res., 2020
On the number of almost envy-free allocations.
Discret. Appl. Math., 2020
Funding Public Projects: A Case for the Nash Product Rule.
CoRR, 2020
On the Structure of Stable Tournament Solutions.
CoRR, 2020
Refining Tournament Solutions via Margin of Victory.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020
2019
Simple Pricing Schemes for the Cloud.
ACM Trans. Economics and Comput., 2019
On Black-Box Transformations in Downward-Closed Environments.
Theory Comput. Syst., 2019
Envy-freeness in house allocation problems.
Math. Soc. Sci., 2019
Fairly allocating contiguous blocks of indivisible items.
Discret. Appl. Math., 2019
On Weighted Envy-Freeness in Indivisible Item Allocation.
CoRR, 2019
Connected Fair Allocation of Indivisible Goods.
CoRR, 2019
Democratic fair allocation of indivisible goods.
Artif. Intell., 2019
Computing a small agreeable set of indivisible items.
Artif. Intell., 2019
Schelling Games on Graphs.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019
2018
Resource allocation and decision making for groups.
PhD thesis, 2018
Approximate maximin shares for groups of agents.
Math. Soc. Sci., 2018
2017
Who Can Win a Single-Elimination Tournament?
SIAM J. Discret. Math., 2017
Asymptotic existence of fair divisions for groups.
Math. Soc. Sci., 2017
On Democratic Fairness for Groups of Agents.
CoRR, 2017
Computing an Approximately Optimal Agreeable Set of Items.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017
2016
Scheduling asynchronous round-robin tournaments.
Oper. Res. Lett., 2016
Upper Bounds on Number of Steals in Rooted Trees.
Theory Comput. Syst., 2016
Asymptotic existence of proportionally fair allocations.
Math. Soc. Sci., 2016
On the efficiency of localized work stealing.
Inf. Process. Lett., 2016
An ordinal minimax theorem.
Games Econ. Behav., 2016
Assigning a Small Agreeable Set of Indivisible Items to Multiple Players.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
2015
Individual and group stability in neutral restrictions of hedonic games.
Math. Soc. Sci., 2015
The Impossibility of Extending Random Dictatorship to Weak Preferences.
CoRR, 2015
2014
On a Subposet of the Tamari Lattice.
Order, 2014
