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.Xunta de Galicia | Ref. ED431B 2019/34Agencia Estatal de Investigación | Ref. ECO2017-82241-RAgencia Estatal de Investigación | Ref. ECO2017-83069-
Documento de trabajoWe consider a coalition formation model in which agents have the possibility of ...
We study the revenue maximizing allocation of several heterogeneous, commonly ranked objects to impa...
International audienceThis paper presents an analytical framework to help understand why some commun...
URL des Documents de travail : http://centredeconomiesorbonne.univ-paris1.fr/documents-de-travail/Do...
International audienceThis paper proposes dynamic programming tools for payoffs based on aggregating...
We introduce a new operator for general rationing problems in which, besides conflicting claims, ind...
International audienceThis paper proposes dynamic programming tools for payoffs based on aggregating...
International audienceWe consider a resource allocation problem, where a rational agent has to decid...
This paper constructs a representative agent supporting the equilibrium allocation in ¡°event-tree¡±...
In this paper we propose a unifying approach to the study of recursive economic problems. Postulatin...
This paper deals with the problem of establishing a new class of aggregation operators, which are cl...
We study stochastic dynamic programming with recursive utility in settings where multiplicity of val...
Suppose a quantity t of a given resource is divided among two agents. If an additional quantity beco...
Dynamic resource allocation problems arise under a variety of settings and have been studied across ...
This paper proposes a way to model boundedly rational dynamic programming in a parsimonious and trac...
Documento de trabajoWe consider a coalition formation model in which agents have the possibility of ...
We study the revenue maximizing allocation of several heterogeneous, commonly ranked objects to impa...
International audienceThis paper presents an analytical framework to help understand why some commun...
URL des Documents de travail : http://centredeconomiesorbonne.univ-paris1.fr/documents-de-travail/Do...
International audienceThis paper proposes dynamic programming tools for payoffs based on aggregating...
We introduce a new operator for general rationing problems in which, besides conflicting claims, ind...
International audienceThis paper proposes dynamic programming tools for payoffs based on aggregating...
International audienceWe consider a resource allocation problem, where a rational agent has to decid...
This paper constructs a representative agent supporting the equilibrium allocation in ¡°event-tree¡±...
In this paper we propose a unifying approach to the study of recursive economic problems. Postulatin...
This paper deals with the problem of establishing a new class of aggregation operators, which are cl...
We study stochastic dynamic programming with recursive utility in settings where multiplicity of val...
Suppose a quantity t of a given resource is divided among two agents. If an additional quantity beco...
Dynamic resource allocation problems arise under a variety of settings and have been studied across ...
This paper proposes a way to model boundedly rational dynamic programming in a parsimonious and trac...
Documento de trabajoWe consider a coalition formation model in which agents have the possibility of ...
We study the revenue maximizing allocation of several heterogeneous, commonly ranked objects to impa...
International audienceThis paper presents an analytical framework to help understand why some commun...