Abstract:
We consider a problem of allocation of limited amount of divisible good among a finite number of agents under transferable utility. We design a mechanism which implements a Pareto efficient allocation as a Nash equilibrium of the induced game. This mechanism is an adaptation of the Groves–Ledyard “quadratic government” that was initially offered for the problem of public good.
Citation:
N. A. Korgin, V. O. Korepanov, “Efficient solution of allotment problem with Groves–Ledyard mechanism under transferable utility”, UBS, 46 (2013), 216–265; Autom. Remote Control, 77:5 (2016), 914–942