Computing leximin-optimal solutions in constraint networks
Artificial Intelligence
Multiobjective Optimization
Solving the linear multiple choice knapsack problem with two objectives: profit and equity
Computational Optimization and Applications
On Principles of Fair Resource Allocation for Importance Weighted Agents
SOCINFO '09 Proceedings of the 2009 International Workshop on Social Informatics
Bicriteria models for fair and efficient resource allocation
SocInfo'10 Proceedings of the Second international conference on Social informatics
Long-term fairness with bounded worst-case losses
Autonomous Agents and Multi-Agent Systems
Operations Research
Egalitarian allocations of indivisible resources: theory and computation
CIA'06 Proceedings of the 10th international conference on Cooperative Information Agents
On direct methods for lexicographic min-max optimization
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Lorenz equilibrium: equitability in non-cooperative games
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Combining Equity and Utilitarianism in a Mathematical Programming Model
Management Science
| Hi-index | 0.00 |
In this expository paper, we review a variety of resource allocation problems in which it is desirable to allocate limited resources equitably among competing activities. Applications for such problems are found in diverse areas, including distribution planning, production planning and scheduling, and emergency services location. Each activity is associated with a performance function, representing, for example, the weighted shortfall of the selected activity level from a specified target. A resource allocation solution is called equitable if no performance function value can be improved without either violating a constraint or degrading an already equal or worse-off (i.e., larger) performance function value that is associated with a different activity. A lexicographic minimax solution determines this equitable solution; that is, it determines the lexicographically smallest vector whose elements, the performance function values, are sorted in nonincreasing order. The problems reviewed include large-scale allocation problems with multiple knapsack resource constraints, multiperiod allocation problems for storable resources, and problems with substitutable resources. The solution of large-scale problems necessitates the design of efficient algorithms that take advantage of special mathematical structures. Indeed, efficient algorithms for many models will be described. We expect that this paper will help practitioners to formulate and solve diverse resource allocation problems, and motivate researchers to explore new models and algorithmic approaches.