Multi-commodity rationing problems with maxmin payoffs

Miguel Hinojosa () and Amparo Mármol ()

Mathematical Methods of Operations Research, 2014, vol. 79, issue 3, 353-370

Abstract: 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. Copyright Springer-Verlag Berlin Heidelberg 2014

Keywords: Rationing problems; Maxmin preferences; Cooperative games (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00186-014-0466-9 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:79:y:2014:i:3:p:353-370

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s00186-014-0466-9

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().