Aggregator operators for dynamic rationing
UNIVERSAL IDENTIFIER: http://hdl.handle.net/11093/2500
EDITED VERSION: https://doi.org/10.1016/j.ejor.2020.06.007
UNESCO SUBJECT: 1207.06 Teoría de Juegos
DOCUMENT TYPE: article
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.
Files in this item
- 2020_moreno_ejor_aggregator_op ...