Bidding for Envy-Freeness: A Procedural Approach to n-Player Fair Division Problems

Claus-Jochen Haake (), Matthias G. Raith and Francis Su
Additional contact information
Matthias G. Raith: University of Bielefeld
Francis Su: Harvey Mudd College

Claremont Colleges Working Papers from Claremont Colleges

Date: 2000
View list of references

Downloads: (external link)
http://www.math.hmc.edu/~su/papers.dir/bfe.pdf (application/pdf)

Related works:
Journal Article: Bidding for envy-freeness: A procedural approach to n-player fair-division problems (2002)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:clm:clmeco:2000-47

Access Statistics for this paper

More papers in Claremont Colleges Working Papers from Claremont Colleges
Contact information at EDIRC.
Series data maintained by ().