Sylvain Bouveret Associate Professor at Grenoble INP, University Grenoble-Alpes, Grenoble, France
Title: Picking Sequences for Resource Allocation
Abstract: Fairly and efficiently dividing a set of indivisible objects between a set of agents is a complex problem with a lot of practical applications. These applications range from allocating courses to students to scheduling observation requests on a constellation of Earth observing satellites. In this talk, after a short general introduction on fair division, we will present a very simple yet remarkable allocation protocol: picking sequences. In spite of its simplicity, making it an appealing protocol for practical use, it has nevertheless very interesting theoretical properties. During the presentation, we will particularly focus on the problem of computing an optimal picking sequence and on aspects related to the agents strategic behaviour.
Biography: Sylvain Bouveret is Associate Professor at Grenoble INP, University Grenoble-Alpes. He graduated in 2004 from the engineering school Supaéro in Toulouse, and obtained a PhD in Computer Science from the University of Toulouse in 2007. From 2007 to 2011 he worked as a Research Engineer at Onera Toulouse. Since 2011 he is teaching at Grenoble INP / Ensimag and doing research at the LIG laboratory in Grenoble. His current research mainly concerns Computational Social Choice.