2025/01/27 by Julien Lesca, Lesca, Julien · 1 voice · 1 citation
Computer Science · Engineering · #Artificial Intelligence (cs.AI) #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Smart Cities and Technologies #Smart Parking Systems Research #cs.AI #cs.GT
paper · pdf · doi:10.48550/arxiv.2501.15916
openalex publication_date 2025/01/27 · arxiv published 2025/01/27 · arxiv updated 2025/07/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper studies an online variant of the celebrated housing market problem, where each agent has a single house and seeks to exchange it for another based on her preferences. In this online setting, agents may arrive and depart at any time, meaning that not all agents are present on the housing market simultaneously. I extend the well known serial dictatorship and Gale s top trading cycle mechanisms to this online scenario, aiming to retain their desirable properties such as Pareto efficiency, individual rationality, and strategy proofness. These extensions also seek to prevent agents from strategically delaying their arrival or advancing their departure. I demonstrate that achieving all of these properties simultaneously is impossible in the online context, and I present several variants that achieve different subsets of these properties.