Characterization of the Walrasian equilibria of the assignment model
We study the assignment model where a collection of indivisible goods are sold to a set of buyers who want to buy at most one good. We characterize the extreme and interior points of the set of Walrasian equilibrium price vectors for this model. Our characterizations are in terms of demand sets of buyers. Using these characterizations, we also give a unique characterization of the minimum and the maximum Walrasian equilibrium price vectors. Also, necessary and sufficient conditions are given under which the interior of the set of Walrasian equilibrium price vectors is non-empty. Several of the results are derived by interpreting Walrasian equilibrium price vectors as potential functions of an appropriate directed graph.
Year of publication: |
2010
|
---|---|
Authors: | Mishra, Debasis ; Talman, Dolf |
Published in: |
Journal of Mathematical Economics. - Elsevier, ISSN 0304-4068. - Vol. 46.2010, 1, p. 6-20
|
Publisher: |
Elsevier |
Keywords: | Assignment model Walrasian equilibrium Iterative auctions Overdemanded set Underdemanded set |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
A characterization of the average tree solution for cycle-free graph games
Mishra, Debasis, (2009)
-
Overdemand and underdemand in economies with invisible goods and unit demands
Mishra, Debasis, (2006)
-
A characterization of the average tree solution for tree games
Mishra, Debasis, (2010)
- More ...