1 code implementation • 28 Apr 2022 • Sirin Botan, Simon Rey, Zoi Terzopoulou
We study settings in which agents with incomplete preferences need to make a collective decision.
no code implementations • 14 Feb 2020 • Aurélie Beynier, Nicolas Maudet, Simon Rey, Parham Shams
Recently, the problem of allocating one resource per agent with initial endowments (house markets) has seen a renewed interest: indeed, while in the domain of strict preferences the Top Trading Cycle algorithm is known to be the only procedure guaranteeing Pareto-optimality, individual rationality, and strategy proofness.
no code implementations • 16 Jul 2019 • Haris Aziz, Simon Rey
We then present a clear taxonomy of the fairness concepts.
no code implementations • 24 Jun 2019 • Aurélie Beynier, Nicolas Maudet, Simon Rey, Parham Shams
We prove that in the single-peaked domain every swap-stable allocation is Pareto-optimal, showing the efficiency of the swap dynamics.
no code implementations • 28 Jul 2018 • Aurélie Beynier, Sylvain Bouveret, Michel Lemaître, Nicolas Maudet, Simon Rey
This paper investigates these notions, when agents have additive preferences over objects, and unveils surprising connections between them, and with other efficiency and fairness notions.