Graphs and algorithms
On ordered weighted averaging aggregation operators in multicriteria decisionmaking
IEEE Transactions on Systems, Man and Cybernetics
Negotiating over small bundles of resources
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Allocation of indivisible goods: a general model and some complexity results
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Undominated VCG redistribution mechanisms
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Assignment Problems
On efficient WOWA optimization for decision support under risk
International Journal of Approximate Reasoning
On Principles of Fair Resource Allocation for Importance Weighted Agents
SOCINFO '09 Proceedings of the 2009 International Workshop on Social Informatics
Efficiency and envy-freeness in fair division of indivisible goods
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Algorithmica - Special Issue: Matching Under Preferences; Guest Editors: David F. Manlove, Robert W. Irving and Kazuo Iwama
Infinite order Lorenz dominance for fair multiagent optimization
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Bicriteria models for fair and efficient resource allocation
SocInfo'10 Proceedings of the Second international conference on Social informatics
Reduction of economic inequality in combinatorial domains
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
This paper proposes several operational approaches for solving fair allocation problems in the context of multiagent optimization. These problems arise in various contexts such as assigning conference papers to referees or sharing of indivisible goods among agents. We present and discuss various social welfare functions that might be used to maximize the satisfaction of agents while maintaining a notion of fairness in the distribution. All these welfare functions are in fact non-linear, which precludes the use of classical min-cost max-flow algorithms for finding an optimal allocation. For each welfare function considered, we present a Mixed Integer Linear Programming formulation of the allocation problem that can be efficiently solved using standard solvers. The results of numerical tests we conducted on realistic cases are given at the end of the paper to confirm the practical feasibility of the proposed approaches.