Organizing time banks: Lessons from matching markets
Tommy Andersson,
Ágnes Cseh,
Lars Ehlers and
Albin Erlanson ()
Cahiers de recherche from Universite de Montreal, Departement de sciences economiques
Abstract:
A time bank is a group of people that set up a common platform to trade services among themselves. There are several well-known problems associated with this type of time banking, e.g., high overhead costs and difficulties to identify feasible trades. This paper constructs a non-manipulable mechanism that selects an individually rational and time-balanced allocation which maximizes exchanges among the members of the time bank (and those allocations are efficient). The mechanism works on a domain of preferences where agents classify services as unacceptable and acceptable (and for those services agents have specific upper quotas representing their maximum needs).
Keywords: Market design; time banking; priority mechanism; non-manipulability (search for similar items in EconPapers)
JEL-codes: D47 D82 (search for similar items in EconPapers)
Pages: 24 pages
Date: 2018
New Economics Papers: this item is included in nep-des, nep-gth and nep-pay
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)
Downloads: (external link)
http://hdl.handle.net/1866/20920 (application/pdf)
Related works:
Working Paper: Organizing Time Banks: Lessons from Matching Markets (2019)
Working Paper: Organizing Time Banks: Lessons from Matching Markets (2018)
Working Paper: Organizing Time Banks: Lessons from Matching Markets (2018)
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: https://EconPapers.repec.org/RePEc:mtl:montde:2018-08
Access Statistics for this paper
More papers in Cahiers de recherche from Universite de Montreal, Departement de sciences economiques Contact information at EDIRC.
Bibliographic data for series maintained by Sharon BREWER ().