Multi-commodity rationing problems with maxmin payoffs

We address a multi-dimensional extension of standard rationing problems in which several commodities have to be shared among a set of agents who exhibit maxmin preferences on the results they obtain. In this context we investigate efficiency and introduce a property of stability which is supported o...

Full description

Saved in:
Bibliographic Details
Published inMathematical methods of operations research (Heidelberg, Germany) Vol. 79; no. 3; pp. 353 - 370
Main Authors Hinojosa, Miguel A., Mármol, Amparo M.
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2014
Springer Nature B.V
Subjects
Allocations
Business and Management
Calculus of Variations and Optimal Control; Optimization
Commodities
Computational efficiency
Games
Mathematical analysis
Mathematics
Mathematics and Statistics
Operations research
Operations Research/Decision Theory
Original Article
Payoffs
Rationing
Studies
Utilities
Rationing problems
Maxmin preferences
Cooperative games
Online AccessGet full text

Cover

More Information
Summary:We address a multi-dimensional extension of standard rationing problems in which several commodities have to be shared among a set of agents who exhibit maxmin preferences on the results they obtain. In this context we investigate efficiency and introduce a property of stability which is supported on a transferable utility game. We also propose a procedure to construct rules for obtaining stable allocations for the special case where all commodities have the same weight.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1432-2994
1432-5217
DOI:10.1007/s00186-014-0466-9