๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Nash implementation of Lindahl allocations

โœ Scribed by Pierre Trenqualye


Publisher
Springer
Year
1994
Tongue
English
Weight
659 KB
Volume
11
Category
Article
ISSN
0176-1714

No coin nor oath required. For personal study only.

โœฆ Synopsis


We define a class of Nash based mechanisms that implement Lindahl allocations in standard public good economies. As those that first proved Nash implementation of Lindahl allocations, defined by Hurwicz (1979) andWalker (1981), the mechanisms provided here are continuous, feasible, and independent of agents' characteristics. In economies with two agents (e.g., bilateral monopolies, duopolies, principal-agent models), our mechanisms are also applicable, in contrast to the well-behaved mechanisms in the literature, and they satisfy favourable stability properties.

1 -m 3 ( k + ) + m , ( k ) = O .

Once can check that the unique equilibrittm (defined by m * = m 2 * --m 3 * = a / 3 ) may not be locally stable. (This can be proved, for example, by showing that if the preference parameter c~ is sufficiently small, then the evolution of


๐Ÿ“œ SIMILAR VOLUMES


An efficient Nash-implementation mechani
โœ Rahul Jain; Jean Walrand ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 422 KB

We propose a mechanism for auctioning bundles of multiple divisible goods in a network where buyers want the same amount of bandwidth on each link in their route. Buyers can specify multiple routes (corresponding to a source-destination pair). The total flow can then be split among these multiple ro