LP solvable models for multiagent fair allocation problems
From MaRDI portal
Publication:2999166
DOI10.3233/978-1-60750-606-5-393zbMATH Open1211.90108OpenAlexW122841170MaRDI QIDQ2999166FDOQ2999166
Publication date: 11 May 2011
Full work available at URL: https://hal.archives-ouvertes.fr/hal-01291467
Recommendations
- Solving house allocation problems with risk-averse agents
- Fair resource allocation: using welfare-based dominance constraints
- Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
- Fairness in resource allocation: foundation and applications
- Improving Nash social welfare approximations of indivisible goods
Agent technology and artificial intelligence (68T42) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)
Cited In (7)
- Combining local search and elicitation for multi-objective combinatorial optimization
- Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach
- The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases
- Computational social choice for coordination in agent networks
- Choquet integral optimisation with constraints and the buoyancy property for fuzzy measures
- A parametric worst-case approach to fairness in cooperative games with transferable utility
- Fair optimization and networks: a survey
This page was built for publication: LP solvable models for multiagent fair allocation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999166)
