相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Fair multi-cake cutting
Erel Segal-Halevi
DISCRETE APPLIED MATHEMATICS (2021)
Envy-Free Matchings with Lower Quotas
Yu Yokoi
ALGORITHMICA (2020)
Local envy-freeness in house allocation problems
Aurelie Beynier et al.
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS (2019)
Envy-freeness in house allocation problems
Jiarui Gan et al.
MATHEMATICAL SOCIAL SCIENCES (2019)
Fair Allocation through Competitive Equilibrium from Generic Incomes
Moshe Babaioff et al.
FAT*'19: PROCEEDINGS OF THE 2019 CONFERENCE ON FAIRNESS, ACCOUNTABILITY, AND TRANSPARENCY (2019)
Fair Enough: Guaranteeing Approximate Maximin Shares
David Kurokawa et al.
JOURNAL OF THE ACM (2018)
Optimal Multi-Way Number Partitioning
Ethan L. Schreiber et al.
JOURNAL OF THE ACM (2018)
Fair Allocation of Indivisible Goods: Improvements and Generalizations
Mohammad Ghodsi et al.
ACM EC'18: PROCEEDINGS OF THE 2018 ACM CONFERENCE ON ECONOMICS AND COMPUTATION (2018)
The lattice of envy-free matchings
Qingyun Wu et al.
GAMES AND ECONOMIC BEHAVIOR (2018)
Approximation Algorithms for Computing Maximin Share Allocations
Georgios Amanatidis et al.
ACM TRANSACTIONS ON ALGORITHMS (2017)
Fair assignment of indivisible objects under ordinal preferences
Haris Aziz et al.
ARTIFICIAL INTELLIGENCE (2015)
The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
Eric Budish
JOURNAL OF POLITICAL ECONOMY (2011)
Rank-Maximal Matchings
Robert W. Irving et al.
ACM TRANSACTIONS ON ALGORITHMS (2006)
分享论文
