Print Email Facebook Twitter Mechanism Design for the Online Allocation of Items without Monetary Payments Title Mechanism Design for the Online Allocation of Items without Monetary Payments Author Jalilzadeh, B. Planken, L. De Weerdt, M.M. Faculty Electrical Engineering, Mathematics and Computer Science Department Software Computer Technology Date 2010-12-31 Abstract We consider online mechanism design without money, where agents are allowed to trade items with other agents, in an attempt to improve their own allocation. In an off-line context, this problem is known as the House Allocation Problem (HAP). We extend HAP to an online problem and call it the Online House Allocation Problem (OHAP). In OHAP, agents can choose when to arrive and depart over time and are allowed to be indifferent between items. Subsequently, we present our Agent Shifting Algorithm (ASA) for OHAP. A mechanism that uses ASA as its allocation rule is shown to be strategy-proof, individually rational and Pareto optimal. Moreover, we argue that any mechanism that obtains an outcome in OHAP that cannot be obtained by using ASA fails to be strategy-proof or is not Pareto optimal. Subject house allocation problemonline mechanism designmechanism design without money To reference this document use: http://resolver.tudelft.nl/uuid:e1fcb9a2-f0e6-483d-bec3-854ff5fb74f3 Publisher Springer Source https://doi.org/doi:10.1007/978-3-642-15117-0_6 Source Lecture Notes in Business Information Processing, 59, 2010; authors version Part of collection Institutional Repository Document type book chapter Rights (c) 2010 SpringerThe original publication is available at www.springerlink.com Files PDF amec09behnam1.pdf 188.14 KB Close viewer /islandora/object/uuid:e1fcb9a2-f0e6-483d-bec3-854ff5fb74f3/datastream/OBJ/view