"Assignment messages" are maximally general messages to describe substitutable preferences by means of a linear program. With "integer assignment messages," there exist integer-valued Walrasian allocations, extending a result of Lloyd S. Shapley and Martin Shubik (1971). Any pure Nash equilibrium profile of the Walrasian mechanism with participants limited to assignment messages is also a Nash equilibrium of the unrestricted Walrasian mechanism. Assignment exchanges are generalizations of single-product double auctions and are related to ascending multi-product clock auctions and the Vickrey mechanism. Assignment messages also have additional applications in mechanism design. (JEL D44, D82)
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Volume (Year): 1 (2009) Issue (Month): 2 (August) Pages: 95-113 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF