Data networks
Resource allocation problems: algorithmic approaches
Resource allocation problems: algorithmic approaches
On the distribution approach to location problems
Computers and Industrial Engineering
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fairness in routing and load balancing
Journal of Computer and System Sciences - Special issue on Internet algorithms
Dual Stochastic Dominance and Related Mean-Risk Models
SIAM Journal on Optimization
The Fairness Challenge in Computer Networks
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
On Equitable Resource Allocation Problems: a Lexicographic Minimax Approach
Operations Research
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fair Game-Theoretic Resource Management in Dedicated Grids
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
Computing leximin-optimal solutions in constraint networks
Artificial Intelligence
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
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
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
| Hi-index | 0.00 |
Resource allocation problems are concerned with the allocation of limited resources among competing agents so as to achieve the best system performances. In systems which serve many users, like in networking, there is a need to respect some fairness rules while looking for the overall efficiency. The so-called Max-Min Fairness is widely used to meet these goals. However, allocating the resource to optimize the worst performance may cause a dramatic worsening of the overall system efficiency. Therefore, several other fair allocation schemes are searched and analyzed. In this paper we show how the scalar inequality measures can be consistently used in bicriteria models to search for fair and efficient allocations while taking into account importance weighting of the agents.