On ordered weighted averaging aggregation operators in multicriteria decisionmaking
IEEE Transactions on Systems, Man and Cybernetics
A lexicographic minimax algorithm for multiperiod resource allocation
Mathematical Programming: Series A and B
The nucleolus of a matrix game and other nucleoli
Mathematics of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Equitable Resource Allocation Problems: a Lexicographic Minimax Approach
Operations Research
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Exploring selfish reinforcement learning in repeated games with stochastic rewards
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the worst-off beneficiaries are treated maximally well, then secondarily the second-worst-off, and so on. We formulate the problem for the situation where the sequence of action choices continues forever; this problem may be reduced to a set of linear programs. We then extend the problem to situations where the game ends at some unknown finite time in the future. We demonstrate that an optimal solution is intractable, and present two good approximation algorithms.