Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Approximation algorithms for NP-hard problems
k-order additive discrete fuzzy measures and their representation
Fuzzy Sets and Systems - Special issue on fuzzy measures and integrals
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
Truth revelation in approximately efficient combinatorial auctions
Proceedings of the 1st ACM conference on Electronic commerce
Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Combinatorial auctions with decreasing marginal utilities
Proceedings of the 3rd ACM conference on Electronic Commerce
Some optimal inapproximability results
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
On the computational power of iterative auctions
Proceedings of the 6th ACM conference on Electronic commerce
Complexity Theory and Cryptology
Complexity Theory and Cryptology
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An improved approximation algorithm for combinatorial auctions with submodular bidders
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM SIGecom Exchanges
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
An approximation algorithm for max-min fair allocation of indivisible goods
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
SIAM Journal on Computing
On allocations that maximize fairness
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal approximation for the submodular welfare problem in the value oracle model
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for the Max-Min Allocation Problem
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Approximating submodular functions everywhere
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The complexity of contract negotiation
Artificial Intelligence
On Maximizing Welfare When Utility Functions Are Subadditive
SIAM Journal on Computing
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders
Mathematics of Operations Research
On Allocating Goods to Maximize Fairness
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Complexity of social welfare optimization in multiagent resource allocation
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
SIAM Journal on Computing
The exact LPT-bound for maximizing the minimum completion time
Operations Research Letters
A polynomial-time approximation scheme for maximizing the minimum machine completion time
Operations Research Letters
Complexity and approximability of social welfare optimization in multiagent resource allocation
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
| Hi-index | 0.00 |
Multiagent resource allocation provides mechanisms to allocate bundles of resources to agents, where resources are assumed to be indivisible and nonshareable. A central goal is to maximize social welfare of such allocations, which can be measured in terms of the sum of utilities realized by the agents (utilitarian social welfare), in terms of their minimum (egalitarian social welfare), and in terms of their product (Nash product social welfare). Unfortunately, social welfare optimization is a computationally intractable task in many settings. We survey recent approximability and inapproximability results on social welfare optimization in multiagent resource allocation, focusing on the two most central representation forms for utility functions of agents, the bundle form and the k-additive form. In addition, we provide some new (in)approximability results on maximizing egalitarian social welfare and social welfare with respect to the Nash product when restricted to certain special cases.