On Fairness via Picking Sequences in Allocation of Indivisible Goods

Autor: Julien Lesca, Laurent Gourvès, Anaëlle Wilczynski

Publikováno v: 7th International Conference on Algorithmic Decision Theory (ADT-21)
7th International Conference on Algorithmic Decision Theory (ADT-21), Nov 2021, Toulouse, France. pp.258-272, ⟨10.1007/978-3-030-87756-9_17⟩
Algorithmic Decision Theory ISBN: 9783030877552
ADT

International audience; Among the fairness criteria for allocating indivisible resources to a group of agents, some are based on minimum utility levels. These levels can come from a specific allocation method, such as maximin fair-share criterion whi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b89d77804b1054ed60aedd862d7a401
https://hal.archives-ouvertes.fr/hal-03406848

A Complexity Approach for Core-Selecting Exchange under Conditionally Lexicographic Preferences

Autor: Julien Lesca, Etsushi Fujita, Akihisa Sonoda, Taiki Todo, Makoto Yokoo

Publikováno v: Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research, Association for the Advancement of Artificial Intelligence, 2018, 63, pp.515-555. ⟨10.1613/jair.1.11254⟩

Core-selection is a crucial property of rules in the literature of resource allocation. It is also desirable, from the perspective of mechanism design, to address the incentive of agents to cheat by misreporting their preferences. This paper investig

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6a6cbc1dc23a290c6133df07a0c1c9a
https://doi.org/10.1613/jair.1.11254

On the Problem of Assigning PhD Grants

Autor: Julien Lesca, Laurent Gourvès, Katarína Cechlárová

Publikováno v: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 2019)
28th International Joint Conference on Artificial Intelligence (IJCAI 2019)
28th International Joint Conference on Artificial Intelligence (IJCAI 2019), Aug 2019, Macao, China. pp.130-136, ⟨10.24963/ijcai.2019/19⟩
IJCAI

International audience; In this paper, we study the problem of assigning PhD grants. Master students apply for PhD grants on different topics and the number of available grants is limited. In this problem, students have preferences over topics they a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c03f145bf30c5b5062409aff608fe30
https://hal.archives-ouvertes.fr/hal-02303512/document

The Fair OWA One-to-one Assignment Problem: NP-hardness and Polynomial Time Special Cases

Autor: Michel Minoux, Julien Lesca, Patrice Perny

Publikováno v: Algorithmica
Algorithmica, Springer Verlag, In press, ⟨10.1007/s00453-018-0434-5⟩

We consider a one-to-one assignment problem consisting of matching n objects with n agents. Any matching leads to a utility vector whose n components measure the satisfaction of the various agents. We want to find an assignment maximizing a global ut

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13f30417b98d80fd9273965514d952be
https://hal.archives-ouvertes.fr/hal-01764024

Compact versus noncompact LP formulations for minimizing convex Choquet integrals

Autor: Michel Minoux, Julien Lesca, Patrice Perny

Publikováno v: Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2013, 161 (1-2), pp.184-199. ⟨10.1016/j.dam.2012.07.007⟩
Discrete Applied Mathematics, 2013, 161 (1-2), pp.184-199. ⟨10.1016/j.dam.2012.07.007⟩

International audience; We address here the problem of minimizing Choquet Integrals (also known as “Lovász Extensions”) over solution sets which can be either polyhedra or (mixed) integer sets. Typical applications of such problems concern the s

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e87f635976fd1cd9f03e6eed854f3125
https://doi.org/10.1016/j.dam.2012.07.007