.png){kind=icon}
.png){kind=icon}
Return
Aggregator operators for dynamic rationing
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2020.06.007.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study dynamic rationing problems. In each period, a fixed group of agents hold claims over an insufficient endowment. The solution to each of these periods' problems might be influenced by the solutions at previous periods. We single out a natural family of aggregator operators, which extend static rules (solving static rationing problems) to construct rules to solve dynamic rationing problems. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Axioms
Resourceallocation
Dynamicmodels
Rationing
Operators
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W