A family of supermodular Nash mechanisms implementing Lindahl allocations
We present a family of mechanisms which implement Lindahl allocations in Nash equilibrium. With quasilinear utility functions this family of mechanisms are supermodular games, which implies that they converge to Nash equilibrium under a wide class of learning dynamics.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 19 (2002)
Issue (Month): 4 ()
|Note:||Received: April 27, 2000; revised version: January 16, 2001|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00199/index.htm |
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:19:y:2002:i:4:p:773-790. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.