相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。An improved approximation algorithm for maximin shares
Jugal Garg et al.
ARTIFICIAL INTELLIGENCE (2021)
Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods
Tobias Heinen et al.
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS (2018)
Fair Enough: Guaranteeing Approximate Maximin Shares
David Kurokawa et al.
JOURNAL OF THE ACM (2018)
Approximation Algorithms for Computing Maximin Share Allocations
Georgios Amanatidis et al.
ACM TRANSACTIONS ON ALGORITHMS (2017)
Gross substitutability: An algorithmic survey
Renato Paes Leme
GAMES AND ECONOMIC BEHAVIOR (2017)
Characterizing conflicts in fair division of indivisible goods using a scale of criteria
Sylvain Bouveret et al.
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS (2016)
An efficient polynomial time approximation scheme for load balancing on uniformly related machines
Leah Epstein et al.
MATHEMATICAL PROGRAMMING (2014)
Submodular Secretary Problem and Extensions
Mohammadhossein Bateni et al.
ACM TRANSACTIONS ON ALGORITHMS (2013)
The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
Eric Budish
JOURNAL OF POLITICAL ECONOMY (2011)
ON MAXIMIZING WELFARE WHEN UTILITY FUNCTIONS ARE SUBADDITIVE
Uriel Feige
SIAM JOURNAL ON COMPUTING (2009)
分享论文
