Multi-commodity rationing problems with maxmin payoffs
Mathematical Methods of Operations Research(2014)
摘要
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.
更多查看译文
关键词
Rationing problems,Maxmin preferences,Cooperative games
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络