Showing 1 - 10 of 88
Persistent link: https://www.econbiz.de/10012003824
We study a multidimensional collective decision under incomplete information. Agents have Euclidean preferences and vote by simple majority on each issue (dimension), yielding the coordinate‐wise median. Judicious rotations of the orthogonal axes—the issues that are voted upon—lead to...
Persistent link: https://www.econbiz.de/10012637397
We characterize the incentive compatible, constrained efficient policy (“second-best”) in a dynamic matching environment, where impatient, privately informed agents arrive over time, and where the designer gradually learns about the distribution of agentsʼ values. We also derive conditions...
Persistent link: https://www.econbiz.de/10011042923
This paper illustrates the benefits of applying mechanism design techniques to questions in revenue management, in particular to dynamic allocation and pricing problems. It is demonstrated that the solution to a sequential stochastic assignment problem under complete information can also be...
Persistent link: https://www.econbiz.de/10010577392
We study the revenue-maximizing allocation of several heterogeneous, commonly ranked objects to impatient agents with privately known characteristics who arrive sequentially. There is a deadline after which no more objects can be allocated. We first characterize implementable allocation schemes,...
Persistent link: https://www.econbiz.de/10005014623
We study the allocation of several heterogenous, commonly ranked objects to impatient agents with privately known characteristics who arrive sequentially according to a Poisson or renewal process. We analyze and compare the policies that maximize either welfare or revenue. We focus on two cases:...
Persistent link: https://www.econbiz.de/10005789155
We study the welfare maximizing assignment of several heterogeneous, commonly ranked objects to impatient agents with privately known characteristics who arrive sequentially according to a Poisson or renewal process. There is a deadline after which no more objects can be allocated. We first show...
Persistent link: https://www.econbiz.de/10008565466
We study an allocation problem where a set of objects needs to be allocated to agents arriving over time. The basic model is of the private, independent values type. The dynamically efficient allocation is implementable if the distribution of agents' values is known. Whereas lack of knowledge...
Persistent link: https://www.econbiz.de/10008574573
Persistent link: https://www.econbiz.de/10010692332
Persistent link: https://www.econbiz.de/10003547998