Theory of linear and integer programming
Theory of linear and integer programming
Computationally Manageable Combinational Auctions
Management Science
On the complexity of integer programming
Journal of the ACM (JACM)
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Solving concisely expressed combinatorial auction problems
Eighteenth national conference on Artificial intelligence
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Combinatorial Auctions
Negotiating socially optimal allocations of resources
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Bidding languages for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
The complexity of contract negotiation
Artificial Intelligence
Infinite order Lorenz dominance for fair multiagent optimization
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
LP Solvable Models for Multiagent Fair Allocation Problems
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Hi-index | 0.00 |
Criteria for measuring economic inequality, such as the Lorenz curve and the Gini index, are widely used in the social sciences but have hardly been explored in Multiagent Systems, even though the significance of other concepts from fair division is widely accepted in the field. In a departure from the standard model used in Economics, we apply inequality criteria to allocation problems with indivisible goods, i.e., to the kind of problem typically analysed in Multiagent Systems. This gives rise to the combinatorial optimisation problem of computing an allocation that reduces inequality with respect to an initial allocation (and the closely related problem of minimising inequality), for a chosen inequality measure. We define this problem, we discuss the computational complexity of various aspects of it, and we formulate a generic approach to designing modular algorithms for solving it using integer programming.