Tommy Andersson (), Ágnes Csehz (), Lars Ehlers () and Albin Erlanson ()
Tommy Andersson: Department of Economics, Lund University, Postal: Department of Economics, School of Economics and Management, Lund University, Box 7082, S-220 07 Lund, Sweden
Ágnes Csehz: Hungarian Academy of Sciences, Institute of Economics, Postal: 1112 Budapest, , Budaörsi ut 45, , Budapest, Hungary
Lars Ehlers: Département de sciences économiques, Université de Montréal, Postal: Québec H3C 3J7,, Canada
Albin Erlanson: Stockholm School of Economics, Department of Economics, Postal: SE-113 83, , Stockholm,, Sweden
Abstract: A time bank is a group of individuals and/or organizations in a local community that set up a common platform to trade services among themselves. There are several well-known problems associated with this type of banking, e.g., high overhead costs for record keeping and difficulties to identify feasible trades. This paper demonstrates that these problems can be solved by organizing time banks as a centralized matching market and, more specifically, by organizing trades based on 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). Such a mechanism does not exist on the general preference domain but on a smaller yet natural domain where agents classify services as unacceptable and acceptable (and for those services agents have specific upper quotas representing their maximum needs). On the general preference domain, it is demonstrated that the proposed mechanism at least can prevent some groups of agents from manipulating the mechanism without dispensing individual rationality, efficiency, or time-balance.
33 pages, First version: July 21, 2018. Revised: March 8, 2019.
Full text files
wp18_19.pdf Full text
Questions (including download problems) about the papers in this series should be directed to Prakriti Thami ()
Report other problems with accessing this service to Sune Karlsson ().
This page generated on 2023-11-03 13:50:57.