Filtres :
CH Chapitres de livres
J Articles de journaux
C Conférences internationales
WS Workshops internationaux
CN Conférences nationales
DS Jeux de données
WP Travaux en cours

## 2022

C22Ligozat Anne-Laure, Marquet Kevin, Bugeau Aurélie, Lefevre Julien, Boulet Pierre, Bouveret Sylvain, Marquet Philippe, Ridoux Olivier et Michel Olivier (2022). How to Integrate Environmental Challenges in Computing Curricula?. In Proceedings of the 53rd ACM Technical Symposium on Computer Science Education (SIGCSE'22), Providence, RI, USA.. ACM.
[Résumé] [BibTeX] [PDF]
This paper advocates for the integration of environmental aspects in computing curricula, with a focus on higher education. We created knowledge-based curriculum specifications in order to help teachers who wish to add knowledge foundation on computing impacts. This document lists topics and references that can be integrated into curricula. We implemented it in several higher education institutions. This paper reports on our experience and feedback. We also discuss recommendations to overcome obstacles that, from our experience, are often faced when modifying computing curricula to integrate environmental challenges.
@InProceedings{LMBLBBMRM-SIGCSE22,
author =	 {Anne-Laure Ligozat and Kevin Marquet and Aurélie Bugeau and Julien Lefevre and Pierre Boulet and Sylvain Bouveret and Philippe Marquet and Olivier Ridoux and Olivier Michel},
title =	 {How to Integrate Environmental Challenges in Computing Curricula?},
booktitle =	 {Proceedings of the 53rd ACM Technical Symposium on Computer Science Education (SIGCSE'22)},
year =	 2022,
month =	 {March},
publisher =	 {ACM},
url =          {http://recherche.noiraudes.net/resources/papers/SIGCSE22.pdf},
abstract =     {This paper advocates for the integration of environmental aspects in computing curricula, with a focus on higher education. We created knowledge-based curriculum specifications in order to help teachers who wish to add knowledge foundation on computing impacts. This document lists topics and references that can be integrated into curricula. We implemented it in several higher education institutions. This paper reports on our experience and feedback. We also discuss recommendations to overcome obstacles that, from our experience, are often faced when modifying computing curricula to integrate environmental challenges.}
}
J7Mittelmann, Munyque, Bouveret, Sylvain et Perrussel, Laurent (2022). Representing and reasoning about auctions. In Auton. Agents Multi Agent Syst., 36(1): 20.
[Résumé] [BibTeX] [URL]
The goal of this paper is to propose a framework for representing and reasoning about the rules of auction-based protocols. Such a framework is of interest for building digital marketplaces based on this type of mechanism. Hence the framework should fulfill two requirements: (i) it should enable bidders to express their preferences over combinations of items and (ii) it should allow the mechanism designer to describe the rules governing the market, namely the legality of bids, the allocative choice, and the payment rule. To do so, we define a logical language in the spirit of the Game Description Language, namely Auction Description Language with a set of functions F(CEDL). CEDL is the first language for describing auctions in a logical framework. With our approach, each stage in a protocol is seen as an independent direct revelation mechanism. Our contribution is three-fold: first, we illustrate the general dimension by representing different kinds of protocols. Second, we show how this machine-processable language enables reasoning about auction properties, including playability, termination, and classical conditions from mechanism design (e.g budget-balance and individual rationality). Finally, we develop a model-checking algorithm for CEDL, with complexity in PTIME when the functions in F can be computed in polynomial time.
@article{MBP-JAAMAS22,
author =	 {Munyque Mittelmann and Sylvain Bouveret and Laurent
Perrussel},
title =	 {Representing and reasoning about auctions},
journal =	 {Auton. Agents Multi Agent Syst.},
volume =	 {36},
number =	 {1},
pages =	 {20},
year =	 {2022},
url =		 {https://doi.org/10.1007/s10458-022-09547-9},
doi =		 {10.1007/s10458-022-09547-9},
abstract =	 {The goal of this paper is to propose a framework for representing and reasoning about the rules of auction-based protocols. Such a framework is of interest for building digital marketplaces based on this type of mechanism. Hence the framework should fulfill two requirements: (i) it should enable bidders to express their preferences over combinations of items and (ii) it should allow the mechanism designer to describe the rules governing the market, namely the legality of bids, the allocative choice, and the payment rule. To do so, we define a logical language in the spirit of the Game Description Language, namely Auction Description Language with a set of functions F(CEDL). CEDL is the first language for describing auctions in a logical framework. With our approach, each stage in a protocol is seen as an independent direct revelation mechanism. Our contribution is three-fold: first, we illustrate the general dimension by representing different kinds of protocols. Second, we show how this machine-processable language enables reasoning about auction properties, including playability, termination, and classical conditions from mechanism design (e.g budget-balance and individual rationality). Finally, we develop a model-checking algorithm for CEDL, with complexity in PTIME when the functions in F can be computed in polynomial time.}
}

## 2021

C21Shams Parham, Beynier Aurélie, Bouveret Sylvain et Maudet Nicolas (2021). Minimizing and balancing envy among agents using Ordered Weighted Average. In Proceedings of the 7th International Conference on Algorithmic Decision Theory (ADT'21), Toulouse, France. Springer Verlag.
[Résumé] [BibTeX] [PDF]
In fair resource allocation, envy freeness (EF) is one of the most interesting fairness criteria as it ensures no agent prefers the bundle of another agent. However, when considering indivisible goods, an EF allocation may not exist. In this paper, we investigate a new relaxation of EF consisting in minimizing the Ordered Weighted Average (OWA) of the envy vector. The idea is to choose the allocation that is fair in the sense of the distribution of the envy among agents. The OWA aggregator is a well-known tool to express fairness in multiagent optimization. In this paper, we focus on fair OWA operators where the weights of the OWA are decreasing. When an EF allocation exists, minimizing OWA envy will return this allocation. However, when no EF allocation exists, one may wonder how fair min OWA envy allocations are. After defining the model, we show how to formulate the computation of such a min OWA envy allocation as a Mixed Integer Program. Then, we investigate the link between the min OWA allocation and other well-known fairness measures such as max min share and EF up to one good or to any good. Finally, we run some experiments comparing the performances of our approach with MNW (Max Nash Welfare) on several criteria such as the percentage of EF up to one good and any good.
@InProceedings{SBBM-ADT21,
author =	 {Shams, Parham and Beynier, Aur\'elie and Bouveret, Sylvain and Maudet, Nicolas},
title =	 {Minimizing and balancing envy among agents using Ordered Weighted Average},
booktitle =	 {Proceedings of the 7th International Conference on Algorithmic Decision Theory (ADT'21)},
year =	 2021,
month =	 {Nov},
publisher =	 {Springer Verlag},
abstract =     {In fair resource allocation, envy freeness (EF) is one of the most interesting fairness criteria as it ensures no agent prefers the bundle of another agent. However, when considering indivisible goods, an EF allocation may not exist. In this paper, we investigate a new relaxation of EF consisting in minimizing the Ordered Weighted Average (OWA) of the envy vector. The idea is to choose the allocation that is fair in the sense of the distribution of the envy among agents. The OWA aggregator is a well-known tool to express fairness in multiagent optimization. In this paper, we focus on fair OWA operators where the weights of the OWA are decreasing. When an EF allocation exists, minimizing OWA envy will return this allocation. However, when no EF allocation exists, one may wonder how fair min OWA envy allocations are. After defining the model, we show how to formulate the computation of such a min OWA envy allocation as a Mixed Integer Program. Then, we investigate the link between the min OWA allocation and other well-known fairness measures such as max min share and EF up to one good or to any good. Finally, we run some experiments comparing the performances of our approach with MNW (Max Nash Welfare) on several criteria such as the percentage of EF up to one good and any good.}
}
C20Mittelmann Munyque, Bouveret Sylvain et Perrussel Laurent (2021). A General Framework for the Logical Representation of Combinatorial Exchange Protocols. In Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS'21), London, UK. IFAAMAS. (short paper).
[Résumé] [BibTeX] [URL]
The goal of this paper is to propose a framework for representing and reasoning about the rules governing a combinatorial exchange. Such a framework is at first interest as long as we want to build up digital marketplaces based on auction, a widely used mechanism for automated transactions. Combinatorial exchange is the most general case of auctions, mixing the double and combinatorial variants: agents bid to trade bundles of goods. Hence the framework should fulfill two requirements: (i) it should enable bidders to express their bids on combinations of goods and (ii) it should allow describing the rules governing some market, namely the legal bids, the allocation and payment rules. To do so, we define a logical language in the spirit of the Game Description Language: the Combinatorial Exchange Description Language is the first language for describing combinatorial exchange in a logical framework. The contribution is two-fold: first, we illustrate the general dimension by representing different kinds of protocols, and second, we show how to reason about auction properties in this machine-processable language.
@InProceedings{MBP-AAMAS21,
author =	 {Mittelmann, Munyque and Bouveret, Sylvain and Perrussel, Laurent},
title =	 {A General Framework for the Logical Representation of Combinatorial Exchange Protocols},
booktitle =	 {Proceedings of the 20th International Conference on
Autonomous Agents and MultiAgent Systems (AAMAS'21)},
year =	 2021,
month =	 {May},
publisher =	 {IFAAMAS},
pages =	 {3 pages},
note =         {(short paper)},
url =          {https://arxiv.org/pdf/2102.02061},
abstract =     {The goal of this paper is to propose a framework for representing and reasoning about the rules governing a combinatorial exchange. Such a framework is at first interest as long as we want to build up digital marketplaces based on auction, a widely used mechanism for automated transactions. Combinatorial exchange is the most general case of auctions, mixing the double and combinatorial variants: agents bid to trade bundles of goods. Hence the framework should fulfill two requirements: (i) it should enable bidders to express their bids on combinations of goods and (ii) it should allow describing the rules governing some market, namely the legal bids, the allocation and payment rules. To do so, we define a logical language in the spirit of the Game Description Language: the Combinatorial Exchange Description Language is the first language for describing combinatorial exchange in a logical framework. The contribution is two-fold: first, we illustrate the general dimension by representing different kinds of protocols, and second, we show how to reason about auction properties in this machine-processable language.}
}

## 2020

C19Shams Parham, Beynier Aurélie, Bouveret Sylvain et Maudet Nicolas (2020). Fair in the Eyes of Others. In Proceedings of the 24th European Conference on Artificial Intelligence (ECAI'20), Santiago de Compostela, Spain. IOS Press.
[Résumé] [BibTeX] [URL]
Envy-freeness is a widely studied notion in resource allocation, capturing some aspects of fairness. The notion of envy being inherently subjective though, it might be the case that an agent envies another agent, but that she objectively has no reason to do so. The difficulty here is to define the notion of objectivity, since no ground-truth can properly serve as a basis of this definition. A natural approach is to consider the judgement of the other agents as a proxy for objectivity. Building on previous work by Parijs (who introduced "unanimous envy") we propose the notion of approval envy: an agent ai experiences approval envy towards aj if she is envious of aj, and sufficiently many agents agree that this should be the case, from their own perspectives. Some interesting properties of this notion are put forward. Computing the minimal threshold guaranteeing approval envy clearly inherits well-known intractable results from envy-freeness, but (i) we identify some tractable cases such as house allocation; and (ii) we provide a general method based on a mixed integer programming encoding of the problem, which proves to be efficient in practice. This allows us in particular to show experimentally that existence of such allocations, with a rather small threshold, is very often observed.
@InProceedings{SBBM-ADT21,
author =	 {Shams, Parham and Beynier, Aur\'elie and Bouveret, Sylvain and Maudet, Nicolas},
title =	 {Minimizing and balancing envy among agents using Ordered Weighted Average},
booktitle =	 {Proceedings of the 7th International Conference on Algorithmic Decision Theory (ADT'21)},
year =	 2021,
month =	 {Nov},
publisher =	 {Springer Verlag},
abstract =     {In fair resource allocation, envy freeness (EF) is one of the most interesting fairness criteria as it ensures no agent prefers the bundle of another agent. However, when considering indivisible goods, an EF allocation may not exist. In this paper, we investigate a new relaxation of EF consisting in minimizing the Ordered Weighted Average (OWA) of the envy vector. The idea is to choose the allocation that is fair in the sense of the distribution of the envy among agents. The OWA aggregator is a well-known tool to express fairness in multiagent optimization. In this paper, we focus on fair OWA operators where the weights of the OWA are decreasing. When an EF allocation exists, minimizing OWA envy will return this allocation. However, when no EF allocation exists, one may wonder how fair min OWA envy allocations are. After defining the model, we show how to formulate the computation of such a min OWA envy allocation as a Mixed Integer Program. Then, we investigate the link between the min OWA allocation and other well-known fairness measures such as max min share and EF up to one good or to any good. Finally, we run some experiments comparing the performances of our approach with MNW (Max Nash Welfare) on several criteria such as the percentage of EF up to one good and any good.}
}
CH4Bouveret, Sylvain, Lang, Jérôme et Lemaître, Michel (2020). Collective Decision Making. In Marquis, Pierre, Papini, Odile et Prade, Henri, éditeurs, A Guided Tour of Artificial Intelligence Research, volume 1, Knowledge Representation, Reasoning and Learning. Chapitre 18.Springer.
[Résumé] [BibTeX] [PDF]
This chapter introduces two prominent models of collective (multiagent) decision making, namely the basic ordinal model, and the utilitarian (numerical/quantitative) model. These models are then illustrated on three major collective decision making problems: voting, fair division and auctions. For each of these three problems we give a formal definition and we discuss the main links with computer science and artificial intelligence.
@InCollection{BLL-CHAPTER-IA20,
author =	 {Sylvain Bouveret and Jérôme Lang and Michel Lemaître},
title =	 {Collective Decision Making},
booktitle =	 {A Guided Tour of Artificial Intelligence Research},
publisher =	 {Springer},
year =	 2020,
editor =	 {Pierre Marquis and Odile Papini and Henri Prade},
volume =	 {1, Knowledge Representation, Reasoning and Learning},
chapter =	 18,
url =          {http://recherche.noiraudes.net/resources/papers/volume-1-chapitre-18-Springer.pdf},
abstract =     {This chapter introduces two prominent models of collective (multiagent) decision making, namely the basic ordinal model, and the utilitarian (numerical/quantitative) model. These models are then illustrated on three major collective decision making problems: voting, fair division and auctions. For each of these three problems we give a formal definition and we discuss the main links with computer science and artificial intelligence.}
}

## 2019

WS14Shams Parham, Beynier Aurélie, Bouveret Sylvain et Maudet Nicolas (2019). Minimizing and balancing envy among agents using Ordered Weighted Average. In Workshop Fair Allocation in Multiagent Systems at AAMAS-19, Montreal, Canada.
[Résumé] [BibTeX] [PDF]
In the problem of fair resource allocation, envy freeness is one of the most interesting fairness criterion as it ensures that no agent prefers the bundle of another agent. However, when considering indivisible goods, an envy-free allocation may not exist. In this paper, we investigate a new relaxation of envy freeness consisting in minimizing the Ordered Weighted Average (OWA) of the envy vector. The idea is to choose the allocation that is fair in the sense of the distribution of the envy among agents. The OWA aggregator is a well-known tool to express fairness in multiagent optimization. In this paper, we focus on fair OWA operators where the weights of the OWA are decreasing. When an envy-free allocation exists, minimizing OWA will return this allocation. However, when no envy-free allocation exists, one may wonder how fair min OWA allocations are. After some definitions and description of the model, we show how to formulate the computation of such a min OWA allocation as a Mixed Integer Program. Then, we investigate the link between the min OWA allocation and other well-known fairness measures such as max min share and envy freeness up to one good or to any good.
@InProceedings{BBLMRS-FAMAS19,
type =         {workshop},
author = 	 {Shams, Parham and Beynier, Aurélie and Bouveret, Sylvain and Maudet, Nicolas},
title = 	 {Minimizing and balancing envy among agents using Ordered Weighted Average},
booktitle =    {Workshop Fair Allocation in Multiagent Systems at AAMAS-19},
year = 	 2019,
month = 	 {May},
abstract =     {In the problem of fair resource allocation, envy freeness is one of the most interesting fairness criterion as it ensures that no agent prefers the bundle of another agent. However, when considering indivisible goods, an envy-free allocation may not exist. In this paper, we investigate a new relaxation of envy freeness consisting in minimizing the Ordered Weighted Average (OWA) of the envy vector. The idea is to choose the allocation that is fair in the sense of the distribution of the envy among agents. The OWA aggregator is a well-known tool to express fairness in multiagent optimization. In this paper, we focus on fair OWA operators where the weights of the OWA are decreasing. When an envy-free allocation exists, minimizing OWA will return this allocation. However, when no envy-free allocation exists, one may wonder how fair min OWA allocations are.

After some definitions and description of the model, we show how to formulate the computation of such a min OWA allocation as a Mixed Integer Program. Then, we investigate the link between the min OWA allocation and other well-known fairness measures such as max min share and envy freeness up to one good or to any good.},
url =          {http://recherche.noiraudes.net/resources/papers/FAMAS19.pdf}
}
C18Beynier Aurélie, Bouveret Sylvain, Lemaître Michel, Maudet Nicolas, Rey Simon et Shams Parham (2019). Efficiency, Sequenceability and Deal-Optimality in Fair Division of Indivisible Goods. In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS'19), Montreal, Canada. IFAAMAS.
[Résumé] [BibTeX] [URL]
In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a designated agent picks one object among those that remain. Another intuitive way to obtain an allocation is to give objects to agents in the first place, and to let agents exchange them as long as such deals'' are beneficial. 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. In particular, we show that an allocation is sequenceable if and only if it is optimal for a certain type of deals, namely cycle deals involving a single object. Furthermore, any Pareto-optimal allocation is sequenceable, but not the converse. Regarding fairness, we show that an allocation can be envy-free and non-sequenceable, but that every competitive equilibrium with equal incomes is sequenceable. To complete the picture, we show how some domain restrictions may affect the relations between these notions. Finally, we experimentally explore the links between the scales of efficiency and fairness.
@InProceedings{BBLMRS-AAMAS19,
author =	 {Beynier, Aur\'elie and Bouveret, Sylvain and
Lema{\^i}tre, Michel and Maudet, Nicolas and Rey,
Simon and Shams, Parham},
title =	 {Efficiency, Sequenceability and Deal-Optimality in
Fair Division of Indivisible Goods},
booktitle =	 {Proceedings of the 18th International Conference on
Autonomous Agents and MultiAgent Systems (AAMAS'19)},
year =	 2019,
month =	 {May},
publisher =	 {IFAAMAS},
pages =	 {9 pages},
url =          {http://recherche.noiraudes.net/en/cycle-deals.php},
abstract =     {In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a designated agent picks one object among those that remain. Another intuitive way to obtain an allocation is to give objects to agents in the first place, and to let agents exchange them as long as such deals'' are beneficial. 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. In particular, we show that an allocation is sequenceable if and only if it is optimal for a certain type of deals, namely cycle deals involving a single object.  Furthermore, any Pareto-optimal allocation is sequenceable, but not the converse. Regarding fairness, we show that an allocation can be envy-free and non-sequenceable, but that every competitive equilibrium with equal incomes is sequenceable. To complete the picture, we show how some domain restrictions may affect the relations between these notions. Finally, we experimentally explore the links between the scales of efficiency and fairness.}
}
J6Bouveret, Sylvain, Cechlárová, Katarína et Lesca, Julien (2019). Chore Division on a Graph. In Autonomous Agents and Multi-Agent Systems, 33(5): 540--563.Springer US
[Résumé] [BibTeX] [PDF]
The paper considers fair allocation of indivisible nondisposable items that generate disutility (chores). We assume that these items are placed in the vertices of a graph and each agent's share has to form a connected subgraph of this graph. Although a similar model has been investigated before for goods, we show that the goods and chores settings are inherently different. In particular, it is impossible to derive the solution of the chores instance from the solution of its naturally associated fair division instance. We consider three common fair division solution concepts, namely proportionality, envy-freeness and equitability, and two individual disutility aggregation functions: additive and maximum based. We show that deciding the existence of a fair allocation is hard even if the underlying graph is a path or a star. We also present some efficiently solvable special cases for these graph topologies.
@article{BCL-JAAMAS19,
author =	 {Bouveret, Sylvain and Cechl\'arov\'a, Katar\'ina and Lesca, Julien},
title =	 {Chore Division on a Graph},
journal =	 "Autonomous Agents and Multi-Agent Systems",
year =	 2019,
month =	 "June",
volume    =    {33},
number    =    {5},
pages     =    {540--563},
url =		 {http://recherche.noiraudes.net/resources/papers/JAAMAS19.pdf},
abstract =	 {The paper considers fair allocation of indivisible nondisposable items that generate disutility (chores). We assume that these items are placed in the vertices of a graph and each agent's share has to form a connected subgraph of this graph. Although a similar model has been investigated before for goods, we show that the goods and chores settings are inherently different. In particular, it is impossible to derive the solution of the chores instance from the solution of its naturally associated fair division instance. We consider three common fair division solution concepts, namely proportionality, envy-freeness and equitability, and two individual disutility aggregation functions: additive and maximum based. We show that deciding the existence of a fair allocation is hard even if the underlying graph is a path or a star. We also present some efficiently solvable special cases for these graph topologies.},
publisher =	 {Springer US},
keywords = {Computational social choice, resource allocation, fair division, indivisible chores}
}
DS2Bouveret, Sylvain, Blanch, Renaud, Baujard, Antoinette, Durand, François, Igersheim, Herrade, Lang, Jérôme, Laruelle, Annick, Laslier, Jean-François, Lebon, Isabelle et Merlin, Vincent (2019). Voter Autrement 2017 for the French Presidential Election -- The data of the In Situ Experiment. . Dataset and companion article on Zenodo.
[Résumé] [BibTeX] [URL]
In March and April 2017, we have run a voting experiment during the French presidential election. During this experiment, participants were asked to test several alternative voting methods to elect the French president, like scoring methods, instant-runoff voting, Borda with partial rankings. The experiment was both carried out in situ in polling stations during the first round of the presidential election (using paper ballots), and online during the month preceding the first round, and until the second round of the election (using a web application). A total of 6358 participants took part to the in situ experiment and 37739 participants took part to the online experiment. This paper describes the protocol of the in situ experiments and the format of the collected dataset.
@Misc{voterautrementinsitu2019,
author =	 {Bouveret, Sylvain and Blanch, Renaud and Baujard,
Antoinette and Durand, Fran\c{c}ois and Igersheim,
Herrade and Lang, J\'er\^ome and Laruelle, Annick
and Laslier, Jean-Fran\c{c}ois and Lebon, Isabelle
and Merlin, Vincent},
title =	 {{Voter Autrement 2017 for the French Presidential
Election -- The data of the In Situ Experiment}},
howpublished = {Dataset and companion article on Zenodo},
month =	 {Nov},
year =	 2019,
doi =		 {10.5281/zenodo.3548574},
url =		 {https://doi.org/10.5281/zenodo.3548574},
abstract =	 {In March and April 2017, we have run a voting experiment during the French presidential election. During this experiment, participants were asked to test several alternative voting methods to elect the French president, like scoring methods, instant-runoff voting, Borda with partial rankings. The experiment was both carried out in situ in polling stations during the first round of the presidential election (using paper ballots), and online during the month preceding the first round, and until the second round of the election (using a web application). A total of 6358 participants took part to the in situ experiment and 37739 participants took part to the online experiment. This paper describes the protocol of the in situ experiments and the format of the collected dataset.}
}

## 2018

C17Aziz Haris, Bouveret Sylvain, Caragiannis Ioannis, Giagkousi Ira et Lang Jérôme (2018). Knowledge, Fairness, and Social Constraints. In Proceedings of the 32nd AAAI conference on Artificial Intelligence (AAAI'18), New Orleans, Louisiana, USA. AAAI Press.
[Résumé] [BibTeX] [PDF]
In the context of fair allocation of indivisible items, fairness concepts often compare the satisfaction of an agent to the satisfaction she would have from items that are not allocated to her: in particular, envy-freeness requires that no agent prefers the share of someone else to her own share. We argue that these notions could also be defined relative to the knowledge that an agent has on how the items that she does not receive are distributed among other agents. We define a family of epistemic notions of envy-freeness, parameterized by a social graph, where an agent observes the share of her neighbours but not of her non-neighbours. We also define an intermediate notion between envy-freeness and proportionality, also parameterized by a social graph. These weaker notions of envy-freeness are useful when seeking a fair allocation, since envy-freeness is often too strong. We position these notions with respect to known ones, thus revealing new rich hierarchies of fairness concepts. Finally, we present a very general framework that covers all the existing and many new fairness concepts.
@InProceedings{ABLM-AAAI18,
author =	 {Haris Aziz and Sylvain Bouveret and Ioannis Caragiannis and Ira Giagkousi and Jérôme Lang},
title =	 {Knowledge, Fairness, and Social Constraints},
booktitle =	 {Proceedings of the 32nd AAAI conference on
Artificial Intelligence (AAAI'18)},
year =	 2018,
publisher =	 {AAAI Press},
address =      {New Orleans, Louisiana, USA},
url =          {http://recherche.noiraudes.net/resources/papers/AAAI18.pdf},
abstract =     {In the context of fair allocation of indivisible items, fairness concepts often compare the satisfaction of an agent to the satisfaction she would have from items that are not allocated to her: in particular, envy-freeness requires that no agent prefers the share of someone else to her own share. We argue that these notions could also be defined relative to the knowledge that an agent has on how the items that she does not receive are distributed among other agents. We define a family of epistemic notions of envy-freeness, parameterized by a social graph, where an agent observes the share of her neighbours but not of her non-neighbours. We also define an intermediate notion between envy-freeness and proportionality, also parameterized by a social graph. These weaker notions of envy-freeness are useful when seeking a fair allocation, since envy-freeness is often too strong. We position these notions with respect to known ones, thus revealing new rich hierarchies of fairness concepts. Finally, we present a very general framework that covers all the existing and many new fairness concepts.}
}
DS1Bouveret, Sylvain, Blanch, Renaud, Baujard, Antoinette, Durand, François, Igersheim, Herrade, Lang, Jérôme, Laruelle, Annick, Laslier, Jean-François, Lebon, Isabelle et Merlin, Vincent (2018). Voter Autrement 2017 - Online Experiment. . Dataset and companion article on Zenodo.
[Résumé] [BibTeX] [URL]
In March and April 2017, we have run a voting experiment during the French presidential election. During this experiment, participants were asked to test several alternative voting methods to elect the French president, like scoring methods, instant-runoff voting, Borda with partial rankings. The experiment was both carried out in situ in polling stations during the first round of the presidential election (using paper ballots), and online during the month preceding the first round, and until the second round of the election (using a web application). A total of 6358 participants took part to the in situ experiment and 37739 participants took part to the online experiment. This dataset contains the answers provided by the participants to the online experiment, with no other processsing than a basic transformation to a set of CSV files. The companion paper available on this repository describes the experimental protocol, the format of the files, and summarizes the precise conditions under which this dataset is available.
@Misc{voterautrementonline2018,
author =	 {Bouveret, Sylvain and Blanch, Renaud and Baujard,
Antoinette and Durand, Fran\c{c}ois and Igersheim,
Herrade and Lang, J\'er\^ome and Laruelle, Annick
and Laslier, Jean-Fran\c{c}ois and Lebon, Isabelle
and Merlin, Vincent},
title =	 {Voter Autrement 2017 - Online Experiment},
howpublished = {Dataset and companion article on Zenodo},
month =	 {July},
year =	 2018,
doi =		 {10.5281/zenodo.1199545},
url =		 {https://doi.org/10.5281/zenodo.1199545},
abstract =     {In March and April 2017, we have run a voting experiment during the French presidential election. During this experiment, participants were asked to test several alternative voting methods to elect the French president, like scoring methods, instant-runoff voting, Borda with partial rankings. The experiment was both carried out in situ in polling stations during the first round of the presidential election (using paper ballots), and online during the month preceding the first round, and until the second round of the election (using a web application). A total of 6358 participants took part to the in situ experiment and 37739 participants took part to the online experiment. This dataset contains the answers provided by the participants to the online experiment, with no other processsing than a basic transformation to a set of CSV files. The companion paper available on this repository describes the experimental protocol, the format of the files, and summarizes the precise conditions under which this dataset is available.}
}

## 2017

WS13Ziébelin Danielle, Hobus Kim, Genoud Philippe et Bouveret Sylvain (2017). Heterogeneous Data Integration Using Web of Data Technologies. In Proceedings of the 15th International Symposium on Web and Wireless Geographical Information Systems (W2GIS 2017), Shanghai, China.
[Résumé] [BibTeX] [URL]
The Coordinated Online Information Network (COIN) is a spatial data infrastructure (SDI) which provides an online network of resources to share, use and integrate information of geographic locations in North Canada. COIN incorporates semantic web technology that integrates, publishes and visualizes time series water data allowing users to access a multitude of datasets in order to compare the data and draw conclusions. COIN utilizes a number of standards from OGC (Open Geospatial Consortium) and W3C (Resource Description Framework, RDF, Web Ontology Language OWL, SPARQL query language for RDF) and GeoSPARQL for geospatial query). COIN benefits from generic ontologies transforming data into semantics, enriching data sets and making the data available and interoperable via WFS and WMS standards. These principles facilitate publication and exchange of data across the web, increasing transparency and interpretability. Through modernized data submission and retrieval we hope to break down the silos of data, allowing users to visualize time series water quality and hydrometric data from multiple sources to increase knowledge in relationship to impacts on Yukon water.
@inproceedings{ZHGB-W2GIS
type      = {workshop},
author    = {Danielle Zi{\'{e}}belin and
Kim Hobus and
Philippe Genoud and
Sylvain Bouveret},
title     = {Heterogeneous Data Integration Using Web of Data Technologies},
booktitle = {Proceedings of the 15th International Symposium on  Web and Wireless Geographical Information Systems ({W2GIS} 2017)},
series    = {Lecture Notes in Computer Science},
volume    = {10181},
pages     = {35--47},
year      = {2017},
month     = may,
abstract  = {The Coordinated Online Information Network (COIN) is a spatial data infrastructure (SDI) which provides an online network of resources to share, use and integrate information of geographic locations in North Canada. COIN incorporates semantic web technology that integrates, publishes and visualizes time series water data allowing users to access a multitude of datasets in order to compare the data and draw conclusions. COIN utilizes a number of standards from OGC (Open Geospatial Consortium) and W3C (Resource Description Framework, RDF, Web Ontology Language OWL, SPARQL query language for RDF) and GeoSPARQL for geospatial query). COIN benefits from generic ontologies transforming data into semantics, enriching data sets and making the data available and interoperable via WFS and WMS standards. These principles facilitate publication and exchange of data across the web, increasing transparency and interpretability. Through modernized data submission and retrieval we hope to break down the silos of data, allowing users to visualize time series water quality and hydrometric data from multiple sources to increase knowledge in relationship to impacts on Yukon water.}
}
C16Sales Fonteles André, Bouveret Sylvain et Gensel Jérôme (2017). A programming framework for Spatial Crowdsourcing. In Proceedings of the 15th International Conference on Advances in Mobile Computing and Multimedia, MoMM 2017, Salzbourg, Austria.
[Résumé] [BibTeX]
Spatial crowdsourcing platforms (SCP) are systems that allow someone, or something, to publish spatial tasks in order to find suitable workforce to perform it. These tasks require people, often using mobile devices, to be at a given location in order to accomplish them. SCPs have been source of much interest for both academy and industry. For this reason, Doan argued in 2011 that the race was now on "toward building general crowdsourcing platforms that can be used to develop such systems quickly". Since then, not much has been done in this matter. More important, there is a gap between what is done in the industry and is proposed in the literature. We propose GENIUS-C, a framework to support the development of SCPs. This framework is based on a generic architecture previously proposed by Fonteles et al., 2016 and designed to bridge the gap between academy and industry. Among other things, GENIUS-C is meant to reduce time-to-market, development cost and effort and increase overall quality of SCPs. A case study SCP has been created using GENIUS-C in order to demonstrate its benefits and how it can be used in the developments of new SCPs.
@inproceedings{SBG-MOMM17,
author =	 {Sales Fonteles, André and Sylvain Bouveret and Jérôme Gensel},
title =	 {A programming framework for Spatial Crowdsourcing},
booktitle =	 {Proceedings of the 15th International Conference on
Advances in Mobile Computing and Multimedia, MoMM
2017},
month =	 {December},
year =	 2017,
abstract =     {Spatial crowdsourcing platforms (SCP) are systems that allow someone, or something, to publish spatial tasks in order to find suitable workforce to perform it. These tasks require people, often using mobile devices, to be at a given location in order to accomplish them. SCPs have been source of much interest for both academy and industry. For this reason, Doan argued in 2011 that the race was now on "toward building general crowdsourcing platforms that can be used to develop such systems quickly". Since then, not much has been done in this matter. More important, there is a gap between what is done in the industry and is proposed in the literature. We propose GENIUS-C, a framework to support the development of SCPs. This framework is based on a generic architecture previously proposed by Fonteles et al., 2016 and designed to bridge the gap between academy and industry. Among other things, GENIUS-C is meant to reduce time-to-market, development cost and effort and increase overall quality of SCPs. A case study SCP has been created using GENIUS-C in order to demonstrate its benefits and how it can be used in the developments of new SCPs.}
}
C15Bouveret Sylvain, Chevaleyre Yann, Durand François et Lang Jérôme (2017). Voting by Sequential Elimination with few Voters. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-17), Melbourne, Australia.
[Résumé] [BibTeX] [PDF]
We define a new class of low-communication voting rules, tailored for contexts with few voters and possibly many candidates. These rules are defined by a predefined sequence of voters: at each stage, the designated voter eliminates a candidate, and the last remaining candidate wins. We study deterministic and randomized versions of these rules. We first investigate their axiomatic properties. Then we focus on a subfamily of rules defined by "non-interleaved" sequences, for which we seek a sequence that best approximates the Borda rule under Impartial Culture. Finally, we apply our rules to randomly generated data.
@InProceedings{BCDL-IJCAI17,
author =	 {Sylvain Bouveret and Yann Chevaleyre and François
Durand and Jérôme Lang},
title =	 {Voting by Sequential Elimination with few Voters},
booktitle =    {Proceedings of the 26th International Joint
Conference on Artificial Intelligence (IJCAI-17)},
year =	 2017,
month =	 aug,
url =		 {http://recherche.noiraudes.net/resources/papers/IJCAI17-sequences.pdf},
abstract =     {We define a new class of low-communication voting rules, tailored for contexts with few voters and possibly many candidates. These rules are defined by a predefined sequence of voters: at each stage, the designated voter eliminates a candidate, and the last remaining candidate wins. We study deterministic and randomized versions of these rules. We first investigate their axiomatic properties. Then we focus on a subfamily of rules defined by "non-interleaved" sequences, for which we seek a sequence that best approximates the Borda rule under Impartial Culture. Finally, we apply our rules to randomly generated data.}
}
C14Bouveret Sylvain, Cechlárová Katarína, Elkind Edith, Igarashi Ayumi et Peters Dominik (2017). Fair Division of a Graph. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-17), Melbourne, Australia.
[Résumé] [BibTeX] [PDF]
We consider fair allocation of indivisible items under an additional constraint: there is an undirected graph describing the relationship between the items, and each agent's share must form a connected subgraph of this graph. This framework captures, e.g., fair allocation of land plots, where the graph describes the accessibility relation among the plots. We focus on agents that have additive utilities for the items, and consider several common fair division solution concepts, such as proportionality, envy-freeness and maximin share guarantee. While finding good allocations according to these solution concepts is computationally hard in general, we design efficient algorithms for special cases where the underlying graph has simple structure, and/or the number of agents -- or, less restrictively, the number of agent types -- is small. In particular, despite non-existence results in the general case, we prove that for acyclic graphs a maximin share allocation always exists and can be found efficiently.
@InProceedings{BCEIP-IJCAI17,
author =	 {Sylvain Bouveret and Katarína Cechlárová and Edith Elkind and Ayumi Igarashi and Dominik Peters},
title =	 {Fair Division of a Graph},
booktitle =    {Proceedings of the 26th International Joint
Conference on Artificial Intelligence (IJCAI-17)},
year =	 2017,
month =	 aug,
url =		 {http://recherche.noiraudes.net/resources/papers/IJCAI17-cakecutting.pdf},
abstract =     {We consider fair allocation of indivisible items under an additional constraint: there is an undirected graph describing the relationship between the items, and each agent's share must form a connected subgraph of this graph. This framework captures, e.g., fair allocation of land plots, where the graph describes the accessibility relation among the plots. We focus on agents that have additive utilities for the items, and consider several common fair division solution concepts, such as proportionality, envy-freeness and maximin share guarantee. While finding good allocations according to these solution concepts is computationally hard in general, we design efficient algorithms for special cases where the underlying graph has simple structure, and/or the number of agents -- or, less restrictively, the number of agent types -- is small. In particular, despite non-existence results in the general case, we prove that for acyclic graphs a maximin share allocation always exists and can be found efficiently.}
}
C13Aziz Haris, Bouveret Sylvain, Lang Jérôme et Mackenzie Simon (2017). Complexity of Manipulating Sequential Allocation. In Proceedings of the 31st AAAI conference on Artificial Intelligence (AAAI'17), San Francisco, California, USA. AAAI Press.
[Résumé] [BibTeX] [PDF]
Sequential allocation is a simple allocation mechanism in which agents are given pre-specified turns in which they take one item among those that are still available. It has long been known that sequential allocation is not strategyproof. This raises the question of the complexity of computing a preference report that yields a higher utility than the truthful preference. We show that the problem is NP-complete for one manipulating agent with additive utilities and several non-manipulating agents. In doing so, we correct a wrong claim made in a previous paper. We then give two additional results. First, we present a polynomial-time algorithm for optimal manipulation when the manipulator has additive binary utilities. Second, we consider a stronger notion of manipulation whereby the untruthful outcome yields more utility than the truthful outcome for all utilities consistent with the ordinal preferences; for this notion, we show that a manipulation, if any, can be computed in polynomial time.
@InProceedings{ABLM-AAAI17,
author =	 {Haris Aziz and Sylvain Bouveret and Jérôme Lang and
Simon Mackenzie},
title =	 {Complexity of Manipulating Sequential Allocation},
booktitle =	 {Proceedings of the 31st AAAI conference on
Artificial Intelligence (AAAI'17)},
year =	 2017,
publisher =	 {AAAI Press},
address =      {San Francisco, California, USA},
url =          {http://recherche.noiraudes.net/resources/papers/AAAI17.pdf},
abstract =     {Sequential allocation is a simple allocation mechanism in which agents are given pre-specified turns in which they take one item among those that are still available. It has long been known that sequential allocation is not strategyproof. This raises the question of the complexity of computing a preference report that yields a higher utility than the truthful preference. We show that the problem is NP-complete for one manipulating agent with additive utilities and several non-manipulating agents. In doing so, we correct a wrong claim made in a previous paper. We then give two additional results. First, we present a polynomial-time algorithm for optimal manipulation when the manipulator has additive binary utilities. Second, we consider a stronger notion of manipulation whereby the untruthful outcome yields more utility than the truthful outcome for all utilities consistent with the ordinal preferences; for this notion, we show that a manipulation, if any, can be computed in polynomial time.}
}
J5Baumeister, Dorothea, Bouveret, Sylvain, Lang, Jérôme, Nguyen, Nhan-Tam, Nguyen, Trung Thanh, Rothe, Jörg et Saffidine, Abdallah (2017). Positional scoring-based allocation of indivisible goods. In Autonomous Agents and Multi-Agent Systems, 31(3): 628--655.Springer US
[Résumé] [BibTeX] [PDF]
We define a family of rules for dividing $m$ indivisible goods among agents, parameterized by a scoring vector and a social welfare aggregation function. We assume that agents' preferences over sets of goods are additive, but that the input is ordinal: each agent reports her preferences simply by ranking single goods. Similarly to positional scoring rules in voting, a scoring vector $s = \left(s$1, … , sm) consists of $m$ nonincreasing, nonnegative weights, where $s$i is the score of a good assigned to an agent who ranks it in position $i$. The global score of an allocation for an agent is the sum of the scores of the goods assigned to her. The social welfare of an allocation is the aggregation of the scores of all agents, for some aggregation function $★$ such as, typically, $+$ or $min$. The rule associated with $s$ and $★$ maps a profile to (one of) the allocation(s) maximizing social welfare. After defining this family of rules, and focusing on some key examples, we investigate some of the social-choice-theoretic properties of this family of rules, such as various kinds of monotonicity, and separability. Finally, we focus on the computation of winning allocations, and on their approximation: we show that for commonly used scoring vectors and aggregation functions this problem is NP-hard and we exhibit some tractable particular cases.
@Article{BBLNNR-JAAMAS17,
author =	 {Dorothea Baumeister and Sylvain Bouveret and Jérôme Lang and Nhan-Tam Nguyen and {Trung Thanh} Nguyen and Jörg Rothe and Abdallah Saffidine},
title =	 {Positional scoring-based allocation of indivisible goods},
journal =	 "Autonomous Agents and Multi-Agent Systems",
year =	 2017,
month =	 "May",
day =		 01,
volume =	 31,
number =	 3,
pages =	 "628--655",
abstract =     {We define a family of rules for dividing $m$ indivisible goods among agents, parameterized by a scoring vector and a social welfare aggregation function. We assume that agents' preferences over sets of goods are additive, but that the input is ordinal: each agent reports her preferences simply by ranking single goods. Similarly to positional scoring rules in voting, a scoring vector $s = (s_1, \ldots , s_m)$ consists of $m$ nonincreasing, nonnegative weights, where $s_i$ is the score of a good assigned to an agent who ranks it in position $i$. The global score of an allocation for an agent is the sum of the scores of the goods assigned to her. The social welfare of an allocation is the aggregation of the scores of all agents, for some aggregation function $\star$ such as, typically, $+$ or $\min$. The rule associated with $s$ and $\star$ maps a profile to (one of) the allocation(s) maximizing social welfare. After defining this family of rules, and focusing on some key examples, we investigate some of the social-choice-theoretic properties of this family of rules, such as various kinds of monotonicity, and separability. Finally, we focus on the computation of winning allocations, and on their approximation: we show that for commonly used scoring vectors and aggregation functions this problem is NP-hard and we exhibit some tractable particular cases.},
issn =	 "1573-7454",
doi =		 "10.1007/s10458-016-9340-x",
url =          {http://recherche.noiraudes.net/resources/papers/JAAMAS16.pdf},
publisher =	 {Springer US},
keywords =	 {Computational social choice; resource allocation; fair division; indivisible goods; preferences},
}
CH3Bouveret, Sylvain (2017). Social Choice on the Web. In Endriss, Ulle, éditeurs, Trends in Computational Social Choice, : 387--402. Chapitre 20.AI Access.
[Résumé] [BibTeX] [PDF]
In this chapter, we speak about the development and use of a web application dedicated to social choice, Whale. The chapter is intended to be a compilation of lessons learned from the users of this web application, rather than an extensive presentation of it. We see through specific use cases what concrete problems have been encountered during the development of this web application.
@InCollection{B-CHAPTER-TRENDS17,
author = 	 {Sylvain Bouveret},
title = 	 {Social Choice on the Web},
editor = 	 {Ulle Endriss},
booktitle = 	 {Trends in Computational Social Choice},
chapter = 	 {20},
pages = 	 {387--402},
publisher =    {AI Access},
url =          {http://research.illc.uva.nl/COST-IC1205/BookDocs/Chapters/TrendsCOMSOC-20.pdf},
year = 	 {2017},
abstract =     {In this chapter, we speak about the development and use of a web application dedicated to social choice, Whale. The chapter is intended to be a compilation of lessons learned from the users of this web application, rather than an extensive presentation of it. We see through specific use cases what concrete problems have been encountered during the development of this web application.}
}

## 2016

WS12Karanikolas Nikos, Blanch Renaud et Bouveret Sylvain (2016). Edge-Compressed Majority Graph: Where Social Choice Meets Information Visualization. In Proceedings of the Sixth International Workshop on Computational Social Choice (COMSOC'16), Toulouse, France.
[Résumé] [BibTeX] [PDF]
Collective decisions are everywhere: choosing central or local governments, selecting a candidate to hire for an open position, choosing a restaurant to share a dinner with some friends are examples of collective decision making situations. Social Choice provides a lot of methods which can help people making a decision in such situations. However, the diversity of these voting procedures and the mathematical background necessary to understand them can be seen as obstacles to the use of these methods in everyday situations by laypersons. We claim that information visualization techniques can help a lot the democratization of social choice, by providing people with some easily interpretable information and, in the end, helping them making informed collective decisions. In this paper, we present the Edge-Compressed Majority Graph, a technique dedicated to the visualization of the majority graph of a preference profile. Using an insight-based evaluation method, we show that this technique gives better results in conveying information about the preferences than other classical visualization techniques.
@InProceedings{KBB-COMSOC16,
type =         {workshop},
author = 	 {Nikos Karanikolas and Renaud Blanch and Sylvain Bouveret},
title = 	 {Edge-Compressed Majority Graph: Where Social Choice Meets Information Visualization},
booktitle =    {Proceedings of the Sixth International Workshop on Computational Social Choice (COMSOC'16)},
year = 	 2016,
month = 	 {June},
abstract =     {Collective decisions are everywhere: choosing central or local governments, selecting a candidate to hire for an open position, choosing a restaurant to share a dinner with some friends are examples of collective decision making situations. Social Choice provides a lot of methods which can help people making a decision in such situations. However, the diversity of these voting procedures and the mathematical background necessary to understand them can be seen as obstacles to the use of these methods in everyday situations by laypersons. We claim that information visualization techniques can help a lot the democratization of social choice, by providing people with some easily interpretable information and, in the end, helping them making informed collective decisions. In this paper, we present the Edge-Compressed Majority Graph, a technique dedicated to the visualization of the majority graph of a preference profile. Using an insight-based evaluation method, we show that this technique gives better results in conveying information about the preferences than other classical visualization techniques.},
url =          {https://www.irit.fr/COMSOC-2016/proceedings/KaranikolasEtAlCOMSOC2016.pdf}
}
WS11Bouveret Sylvain et Lemaître Michel (2016). Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences. In Proceedings of the Sixth International Workshop on Computational Social Choice (COMSOC'16), Toulouse, France.
[Résumé] [BibTeX] [PDF]
In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is the following: at each stage, a designated agent picks one object among those that remain. This paper, restricted to the case where the agents have numerical additive preferences over objects, revisits to some extent the seminal paper by Brams and King (2005) which was specific to ordinal and linear order preferences over items. We point out similarities and differences with this latter context. In particular, we show that any Pareto-optimal allocation (under additive preferences) is sequenceable, but that the converse is not true anymore. This asymmetry leads naturally to the definition of a scale of efficiency'' having three steps: Pareto-optimality, sequenceability without Pareto-optimality, and non-sequenceability. Finally, we investigate the links between these efficiency properties and the scale of fairness'' we have described in an earlier work (Bouveret and Lemaître, 2015): we first show that an allocation can be envy-free and non-sequenceable, but that every competitive equilibrium with equal incomes is sequenceable. Then we experimentally explore the links between the scales of efficiency and fairness.
@InProceedings{BL-COMSOC16,
type =         {workshop},
author = 	 {Sylvain Bouveret and Michel Lemaître},
title = 	 {Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences},
booktitle =    {Proceedings of the Sixth International Workshop on Computational Social Choice (COMSOC'16)},
year = 	 2016,
month = 	 {June},
abstract =     {In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is the following: at each stage, a designated agent picks one object among those that remain. This paper, restricted to the case where the agents have numerical additive preferences over objects, revisits to some extent the seminal paper by Brams and King (2005) which was specific to ordinal and linear order preferences over items. We point out similarities and differences with this latter context.  In particular, we show that any Pareto-optimal allocation (under additive preferences) is sequenceable, but that the converse is not true anymore.  This asymmetry leads naturally to the definition of a scale of efficiency'' having three steps: Pareto-optimality, sequenceability without Pareto-optimality, and non-sequenceability.  Finally, we investigate the links between these efficiency properties and the scale of fairness'' we have described in an earlier work (Bouveret and Lemaître, 2015): we first show that an allocation can be envy-free and non-sequenceable, but that every competitive equilibrium with equal incomes is sequenceable. Then we experimentally explore the links between the scales of efficiency and fairness.},
url =          {https://www.irit.fr/COMSOC-2016/proceedings/BouveretLemaitreCOMSOC2016.pdf}
}
J4Fonteles, André Sales, Bouveret, Sylvain et Gensel, Jérôme (2016). Trajectory recommendation for task accomplishment in crowdsourcing - a model to favour different actors. In Journal of Location Based Services, 10(2): 125-141.Taylor & Francis
[Résumé] [BibTeX]
Crowdsourcing systems (CS) are platforms that enable users, called requesters, to publish tasks that others, called workers, are expected to accomplish. Usually, these are systems where workers perform tasks using desktop computers. Recently, some CS have appeared with location-based tasks that require a worker to be at a given location within a given time window to be accomplished. In this paper, we study the problem of matching these location-based tasks and mobile workers under a novel perspective where three actors (workers, requesters and the system itself) of the CS may benefit differently from a configuration of tasks and workers. We introduce the Trajectory Recommendation Problem (TRP) where a CS finds a trajectory (sequence of tasks) for a single mobile worker that maximises the satisfaction of one or more of the actors. We show that TRP is NP-complete and then propose an exact algorithm for solving it. Our experiments have proved that our algorithm is a feasible solution when up to a few hundred tasks must be analysed to find an optimal solution. Finally, we propose an architecture for the deployment of the recommendation in a CS.
@article{SBG-JLBS16,
author =	 {André Sales Fonteles and Sylvain Bouveret and Jérôme
Gensel},
title =	 {Trajectory recommendation for task accomplishment in
crowdsourcing - a model to favour different actors},
journal =	 {Journal of Location Based Services},
volume =	 10,
number =	 2,
pages =	 {125-141},
year =	 2016,
publisher =	 {Taylor \& Francis},
doi =		 {10.1080/17489725.2016.1184770},
abstract =     {Crowdsourcing systems (CS) are platforms that enable users, called requesters, to publish tasks that others, called workers, are expected to accomplish. Usually, these are systems where workers perform tasks using desktop computers. Recently, some CS have appeared with location-based tasks that require a worker to be at a given location within a given time window to be accomplished. In this paper, we study the problem of matching these location-based tasks and mobile workers under a novel perspective where three actors (workers, requesters and the system itself) of the CS may benefit differently from a configuration of tasks and workers. We introduce the Trajectory Recommendation Problem (TRP) where a CS finds a trajectory (sequence of tasks) for a single mobile worker that maximises the satisfaction of one or more of the actors. We show that TRP is NP-complete and then propose an exact algorithm for solving it. Our experiments have proved that our algorithm is a feasible solution when up to a few hundred tasks must be analysed to find an optimal solution. Finally, we propose an architecture for the deployment of the recommendation in a CS.}
}
CH2Bouveret, Sylvain, Chevaleyre, Yann et Maudet, Nicolas (2016). Fair Allocation of Indivisible Goods. In Brandt, Felix, Conitzer, Vincent, Endriss, Ulle, Lang, Jérôme et Procaccia, Ariel D., éditeurs, Handbook of Computational Social Choice, Chapitre 12.Cambridge University Press.
[Résumé] [BibTeX] [URL]
This chapter deals with fair division of indivisible goods. The first part of the chapter is dedicated to preference representation for resource allocation problems. Then we introduce fairness and efficiency criteria and focus on the computational aspects of fair division, namely, complexity and algorithmic issues of the centralized computation of fair allocations. The final part of the chapter is dedicated to distributed protocols for fair division.
@InCollection{BCM-CHAPTER-COMSOC16,
author =	 {Sylvain Bouveret and Yann Chevaleyre and Nicolas Maudet},
title =	 {Fair Allocation of Indivisible Goods},
booktitle =	 {Handbook of Computational Social Choice},
publisher =	 {Cambridge University Press},
url       =    {http://recherche.noiraudes.net/en/handbook.php},
year =	 2016,
editor =	 {Felix Brandt and Vincent Conitzer and Ulle Endriss
and Jérôme Lang and Ariel D. Procaccia},
chapter =	 12,
abstract =     {This chapter deals with fair division of indivisible goods. The first part of the chapter is dedicated to preference representation for resource allocation problems. Then we introduce fairness and efficiency criteria and focus on the computational aspects of fair division, namely, complexity and algorithmic issues of the centralized computation of fair allocations. The final part of the chapter is dedicated to distributed protocols for fair division.}
}

## 2015

CN7Sales Fonteles André, Bouveret Sylvain et Gensel Jérôme (2015). Recommandation opportuniste de trajectoires pour l'accomplissement de tâches dans les systèmes crowdsourcing. In Actes du XXXIIIème Congrès INFORSID, Biarritz, France.
[Résumé] [BibTeX]
Les systèmes de marché Crowdsourcing (CMS) sont des plateformes qui permettent à quelqu'un de publier des tâches afin qu'elles soient accomplies par d'autres. Récemment, un type de CMS est apparu dans lequel des tâches spatio-temporelles doivent être accomplies par des personnes dans une fenêtre de temps et un lieu précis. Dans cet article, nous présentons le Problème de Recommandation de Trajectoires Utiles (PRTU), qui permet à une personne qui veut se déplacer d'accomplir des tâches spatio-temporelles pour lesquelles elle montre une grande affinité et/ou aptitude, sans compromettre son arrivée dans les temps à destination. Nous démontrons que le PRTU est NP-complet (dans sa version décisionnelle) et lui proposons un algorithme exact. En outre, nous proposons une architecture de référence pour aider dans l'emploi de la recommandation de ces trajectoires dans un CMS réel. Enfin, nos expérimentations montrent que l'algorithme proposé est une solution faisable pour les instances de PRTU ayant quelques centaines de tâches ou moins.
@inproceedings{SBG-INFORSID15,
type =	 {confnat},
author =	 {Sales Fonteles, André and Sylvain Bouveret and Jérôme
Gensel},
title =	 {Recommandation opportuniste de trajectoires pour
l'accomplissement de tâches dans les systèmes
crowdsourcing},
booktitle =	 {Actes du XXXIIIème Congrès INFORSID},
month =	 {May},
pages =	 {201--215},
year =	 {2015},
abstract =     {Les systèmes de marché Crowdsourcing (CMS) sont des plateformes qui permettent à quelqu'un de publier des tâches afin qu'elles soient accomplies par d'autres. Récemment, un type de CMS est apparu dans lequel des tâches spatio-temporelles doivent être accomplies par des personnes dans une fenêtre de temps et un lieu précis. Dans cet article, nous présentons le Problème de Recommandation de Trajectoires Utiles (PRTU), qui permet à une personne qui veut se déplacer d'accomplir des tâches spatio-temporelles pour lesquelles elle montre une grande affinité et/ou aptitude, sans compromettre son arrivée dans les temps à destination. Nous démontrons que le PRTU est NP-complet (dans sa version décisionnelle) et lui proposons un algorithme exact. En outre, nous proposons une architecture de référence pour aider dans l'emploi de la recommandation de ces trajectoires dans un CMS réel. Enfin, nos expérimentations montrent que l'algorithme proposé est une solution faisable pour les instances de PRTU ayant quelques centaines de tâches ou moins.}
}
WS10Sales Fonteles André, Bouveret Sylvain et Gensel Jérôme (2015). Opportunistic Trajectory Recommendation for Task Accomplishment in Crowdsourcing Systems. In Gensel, Jérôme et Tomko, Martin, éditeurs, Proceedings of the 14th International Symposium on Web and Wireless Geographical Information Systems (W2GIS 2015), Grenoble, France.
[Résumé] [BibTeX]
Crowdsourcing market systems (CMS) are platforms that enable one to publish tasks that others are intended to accomplished. Usually, these are systems where users, called workers, perform tasks using desktop computers. Recently, some CMS have appeared with spatiotemporal tasks that requires a worker to be at a given location within a given time window to be accomplished. In this paper, we introduce the trajectory recommendation problem (or TRP) where a CMS tries to find and recommend a trajectory for a mobile worker that allows him to accomplish tasks he has some affinity with without compromising his arrival in time at destination. We show that TRP is NP-hard and then propose an exact algorithm for solving it. Our experimentation proved that using our algorithm for recommending trajectories is a feasible solution when up to a few hundred tasks must be analyzed to find an optimal solution.
@inproceedings{SBG-W2GIS15,
type =	 {workshop},
author =	 {Sales Fonteles, André and Sylvain Bouveret and Jérôme
Gensel},
title =	 {Opportunistic Trajectory Recommendation for Task
Accomplishment in Crowdsourcing Systems},
booktitle =	 {Proceedings of the 14th International Symposium on  Web and Wireless Geographical Information Systems ({W2GIS} 2015)},
month =        {May},
editor =	 {Jérôme Gensel and Martin Tomko},
series =	 {Lecture Notes in Computer Science},
pages =	 {178--190},
year =	 {2015},
abstract =     {Crowdsourcing market systems (CMS) are platforms that enable one to publish tasks that others are intended to accomplished. Usually, these are systems where users, called workers, perform tasks using desktop computers. Recently, some CMS have appeared with spatiotemporal tasks that requires a worker to be at a given location within a given time window to be accomplished. In this paper, we introduce the trajectory recommendation problem (or TRP) where a CMS tries to find and recommend a trajectory for a mobile worker that allows him to accomplish tasks he has some affinity with without compromising his arrival in time at destination. We show that TRP is NP-hard and then propose an exact algorithm for solving it. Our experimentation proved that using our algorithm for recommending trajectories is a feasible solution when up to a few hundred tasks must be analyzed to find an optimal solution.}
}
C12Sales Fonteles André, Bouveret Sylvain et Gensel Jérôme (2015). Heuristics for Task Recommendation in Spatiotemporal Crowdsourcing Systems. In Chen, Liming Luke, Steinbauer, Matthias, Khalil, Ismail et Anderst-Kotsis, Gabriele, éditeurs, Proceedings of the 13th International Conference on Advances in Mobile Computing and Multimedia, MoMM 2015, Brussels, Belgium.
[Résumé] [BibTeX]
Crowdsourcing systems (CS) are platforms that enable a system or a user to publish tasks in order to be accomplished by others. Typically, a CS is a system where users, called workers, perform tasks using desktop computers. Recently, some CS have appeared with spatiotemporal tasks. Such tasks require a worker to be in a given location within a specific time-window to be accomplished. We propose and study here the usage of five heuristics for solving the NP-hard trajectory recommendation problem (TRP). In a TRP, the system recommends a trajectory to a worker that allows him to accomplish spatiotemporal tasks he has skill and/or affinity with, without exceeding his available time. Our experiments show that some of our heuristics are efficient alternatives for a heavy optimal approach providing trajectories with an average utility of about 60% of the optimal ones.
@inproceedings{SBG-MOMM15,
author =	 {Sales Fonteles, André and Sylvain Bouveret and
Jérôme Gensel},
editor =	 {Liming Luke Chen and Matthias Steinbauer and Ismail
Khalil and Gabriele Anderst{-}Kotsis},
title =	 {Heuristics for Task Recommendation in Spatiotemporal
Crowdsourcing Systems},
booktitle =	 {Proceedings of the 13th International Conference on
Advances in Mobile Computing and Multimedia, MoMM
2015},
month =	 {December},
pages =	 {1--5},
year =	 2015,
abstract =     {Crowdsourcing systems (CS) are platforms that enable a system or a user to publish tasks in order to be accomplished by others. Typically, a CS is a system where users, called workers, perform tasks using desktop computers. Recently, some CS have appeared with spatiotemporal tasks. Such tasks require a worker to be in a given location within a specific time-window to be accomplished. We propose and study here the usage of five heuristics for solving the NP-hard trajectory recommendation problem (TRP). In a TRP, the system recommends a trajectory to a worker that allows him to accomplish spatiotemporal tasks he has skill and/or affinity with, without exceeding his available time. Our experiments show that some of our heuristics are efficient alternatives for a heavy optimal approach providing trajectories with an average utility of about 60\% of the optimal ones.}
}
J3Bouveret, Sylvain et Lemaître, Michel (2015). Characterizing conflicts in fair division of indivisible goods using a scale of criteria. In Autonomous Agents and Multi-Agent Systems, 30(2): 259--290.Springer US
[Résumé] [BibTeX] [PDF]
We investigate five different fairness criteria in a simple model of fair resource allocation of indivisible goods based on additive preferences. We show how these criteria are connected to each other, forming an ordered scale that can be used to characterize how conflicting the agents' preferences are: for a given instance of a resource allocation problem, the less conflicting the agents' preferences are, the more demanding criterion this instance is able to satisfy, and the more satisfactory the allocation can be. We analyze the computational properties of the five criteria, give some experimental results about them, and further investigate a slightly richer model with k-additive preferences.
@article{BL-JAAMAS15,
year =	 {2015},
issn =	 {1573-7454},
journal =	 {Autonomous Agents and Multi-Agent Systems},
doi =		 {10.1007/s10458-015-9287-3},
title =	 {Characterizing conflicts in fair division of
indivisible goods using a scale of criteria},
url =		 {http://recherche.noiraudes.net/resources/papers/JAAMAS15.pdf},
publisher =	 {Springer US},
keywords =	 {Computational social choice; Resource allocation;
Fair division; Indivisible goods; Preferences},
author =	 {Bouveret, Sylvain and Lemaître, Michel},
volume =       {30},
number =       {2},
pages =	 {259--290},
abstract =     {We investigate five different fairness criteria in a simple model of fair resource allocation of indivisible goods based on additive preferences. We show how these criteria are connected to each other, forming an ordered scale that can be used to characterize how conflicting the agents' preferences are: for a given instance of a resource allocation problem, the less conflicting the agents' preferences are, the more demanding criterion this instance is able to satisfy, and the more satisfactory the allocation can be. We analyze the computational properties of the five criteria, give some experimental results about them, and further investigate a slightly richer model with k-additive preferences.}
}

## 2014

WS9Sales Fonteles André, Bouveret Sylvain et Gensel Jérôme (2014). Towards matching improvement between spatio-temporal tasks and workers in mobile crowdsourcing market systems. In Proceedings of the Third ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems (MobiGIS 2014), Dallas / Forth Worth, Texas, USA.
[Résumé] [BibTeX]
@InProceedings{SBG-MOBIGIS14,
type      = {workshop},
author =	 {Sales Fonteles, André and Sylvain Bouveret and Jérôme
Gensel},
title =	 {Towards matching improvement between spatio-temporal
tasks and workers in mobile crowdsourcing market
systems},
booktitle = {Proceedings of the Third {ACM} {SIGSPATIAL}
International Workshop on Mobile Geographic
Information Systems (MobiGIS 2014)},
year =	 2014,
month =	 {November},
address =	 {Dallas / Forth Worth, Texas, USA},
}
CN6Sales Fonteles André, Gensel Jérôme et Bouveret Sylvain (2014). Améliorer l'appariement entre tâches et exécutants dans les Systèmes de Marché Participatifs Mobiles. In Actes de la 11ème conférence francophone en géomatique et analyse spatiale (SAGEO'2014), Grenoble, France.
[Résumé] [BibTeX]
Les Systèmes de Marché Participatifs ou Crowdsourcing Market Systems (CMS) sont des plateformes qui permettent à des utilisateurs, appelés commanditaires, de soumettre des tâches de tout ordre qui pourront être effectuées par d'autres utilisateurs, appelés exécutants, gratuitement ou moyennant une récompense. Récemment sont apparus les CMS mobiles dont la particularité est que les tâches exploitent la mobilité et la localisation des exécutants. Un problème des CMS est que plus les tâches sont nombreuses, plus il est difficile pour les exécutants potentiels de trouver la tâche qu'ils souhaitent réaliser. En outre, les exécutants n'ont souvent pas de compétence particulière et peuvent donc réaliser des tâches de façon non satisfaisante pour les commanditaires. Nous proposons un cadre conceptuel, composé de deux mécanismes, pour améliorer l'adéquation entre les exécutants mobiles et les tâches géo-localisées dans les CMS mobiles. L'un tient compte des exigences formulées par le commanditaire pour chaque tâche afin d'améliorer la sélection des exécutants les plus compétents ; l'autre recommande des tâches à un exécutant en prenant en compte ses préférences, ainsi que son contexte spatio-temporel. Le cadre conceptuel proposé permet aux exécutants de passer moins de temps à chercher des tâches qui leur conviennent, et de se consacrer davantage à leur réalisation, améliorant globalement l'efficacité des CMS mobiles.
@InProceedings{SGB-SAGEO14,
type =	 {confnat},
author =	 {Sales Fonteles, André and Jérôme Gensel and Sylvain
Bouveret},
title =	 {Améliorer l'appariement entre tâches et exécutants
dans les Systèmes de Marché Participatifs Mobiles},
booktitle =	 {Actes de la 11ème conférence francophone en
géomatique et analyse spatiale (SAGEO'2014)},
year =	 2014,
month =	 {November},
abstract =     {Les Systèmes de Marché Participatifs ou Crowdsourcing Market Systems (CMS) sont des plateformes qui permettent à des utilisateurs, appelés commanditaires, de soumettre des tâches de tout ordre qui pourront être effectuées par d'autres utilisateurs, appelés exécutants, gratuitement ou moyennant une récompense. Récemment sont apparus les CMS mobiles dont la particularité est que les tâches exploitent la mobilité et la localisation des exécutants. Un problème des CMS est que plus les tâches sont nombreuses, plus il est difficile pour les exécutants potentiels de trouver la tâche qu'ils souhaitent réaliser. En outre, les exécutants n'ont souvent pas de compétence particulière et peuvent donc réaliser des tâches de façon non satisfaisante pour les commanditaires. Nous proposons un cadre conceptuel, composé de deux mécanismes, pour améliorer l'adéquation entre les exécutants mobiles et les tâches géo-localisées dans les CMS mobiles. L'un tient compte des exigences formulées par le commanditaire pour chaque tâche afin d'améliorer la sélection des exécutants les plus compétents ; l'autre recommande des tâches à un exécutant en prenant en compte ses préférences, ainsi que son contexte spatio-temporel. Le cadre conceptuel proposé permet aux exécutants de passer moins de temps à chercher des tâches qui leur conviennent, et de se consacrer davantage à leur réalisation, améliorant globalement l'efficacité des CMS mobiles.}
}
WS8Bouveret Sylvain et Lang Jérôme (2014). Manipulating picking sequences. In Proceedings of the Fifth International Workshop on Computational Social Choice (COMSOC'14), Pittsburgh, Pennsylvania.
[Résumé] [BibTeX] [PDF] [Version longue (PDF)]
Picking sequences are a natural way of allocating indivisible items to agents in a decentralized manner: at each stage, a designated agent chooses an item among those that remain available. We address the computational issues of the manipulation of picking sequences by an agent or a coalition of agents. We show that a single agent can compute an optimal manipulation in polynomial time. Then we consider several notions of coalitional manipulation; for one of these notions, we show that computing an optimal manipulation is easy. We temper these results by giving a nontrivial upper bound on the impact of manipulation on the loss of social welfare.
@InProceedings{BL-COMSOC14,
type      = {workshop},
author = 	 {Sylvain Bouveret and Jérôme Lang},
title = 	 {Manipulating picking sequences},
booktitle =    {Proceedings of the Fifth International Workshop on Computational Social Choice (COMSOC'14)},
year = 	 2014,
month = 	 {June},
abstract =     {Picking sequences are a natural way of allocating indivisible items to agents in a decentralized manner: at each stage, a designated agent chooses an item among those that remain available. We address the computational issues of the manipulation of picking sequences by an agent or a coalition of agents. We show that a single agent can compute an optimal manipulation in polynomial time. Then we consider several notions of coalitional manipulation; for one of these notions, we show that computing an optimal manipulation is easy. We temper these results by giving a nontrivial upper bound on the impact of manipulation on the loss of social welfare.},
url       = {http://recherche.noiraudes.net/resources/papers/COMSOC14.pdf},
urlfull   = {http://recherche.noiraudes.net/resources/papers/ECAI14-full.pdf}
}
C11Bouveret Sylvain et Lang Jérôme (2014). Manipulating picking sequences. In Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14), Prague, Czech Republic. IOS Press.
[Résumé] [BibTeX] [PDF] [Version longue (PDF)]
Picking sequences are a natural way of allocating indivisible items to agents in a decentralized manner: at each stage, a designated agent chooses an item among those that remain available. We address the computational issues of the manipulation of picking sequences by an agent or a coalition of agents. We show that a single agent can compute an optimal manipulation in polynomial time. Then we consider several notions of coalitional manipulation; for one of these notions, we show that computing an optimal manipulation is easy. We temper these results by giving a nontrivial upper bound on the impact of manipulation on the loss of social welfare.
@InProceedings{BL-ECAI14,
author = 	 {Sylvain Bouveret and Jérôme Lang},
title = 	 {Manipulating picking sequences},
booktitle =    {Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14)},
year = 	 2014,
month = 	 {August},
publisher =    {{IOS} Press},
abstract =     {Picking sequences are a natural way of allocating indivisible items to agents in a decentralized manner: at each stage, a designated agent chooses an item among those that remain available. We address the computational issues of the manipulation of picking sequences by an agent or a coalition of agents. We show that a single agent can compute an optimal manipulation in polynomial time. Then we consider several notions of coalitional manipulation; for one of these notions, we show that computing an optimal manipulation is easy. We temper these results by giving a nontrivial upper bound on the impact of manipulation on the loss of social welfare.},
url       = {http://recherche.noiraudes.net/resources/papers/ECAI14.pdf},
urlfull   = {http://recherche.noiraudes.net/resources/papers/ECAI14-full.pdf}
}
C10Bouveret Sylvain et Lemaître Michel (2014). Characterizing Conflicts in Fair Division of Indivisible Goods Using a Scale of Criteria. In Proceedings of the 13th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS'14), Paris, France. ACM. Runner up for best paper award.
[Résumé] [BibTeX] [PDF] [Version longue (PDF)]
We investigate five different fairness criteria in a simple model of fair resource allocation of indivisible goods based on additive preferences. We show how these criteria are connected to each other, forming an ordered scale that can be used to characterize how conflicting the agents' preferences are: the less conflicting the preferences are, the more demanding criterion this instance will be able to satisfy, and the more satisfactory the allocation will be. We analyze the computational properties of the five criteria, give some experimental results about them, and further investigate a slightly richer model with $k$-additive preferences.
@InProceedings{BL-AAMAS14,
author    = {Sylvain Bouveret and Michel Lemaître},
title     = {Characterizing Conflicts in Fair Division of Indivisible Goods Using a Scale of Criteria},
booktitle = {Proceedings of the 13th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS'14)},
year      = 2014,
month     = {May},
publisher = {ACM},
abstract  = {We investigate five different fairness criteria in a simple model of fair resource allocation of indivisible goods based on additive
preferences. We show how these criteria are connected to each other, forming an ordered scale that can be used to characterize how conflicting the agents' preferences are: the less conflicting the preferences are, the more demanding criterion this instance will be able to satisfy, and the more satisfactory the allocation will be. We analyze the computational properties of the five criteria, give some experimental results about them, and further investigate a slightly richer model with $k$-additive preferences.},
url       = {http://recherche.noiraudes.net/resources/papers/AAMAS14.pdf},
urlfull   = {http://recherche.noiraudes.net/resources/papers/AAMAS14-full.pdf},
note      = {Runner up for best paper award}
}
C9Baumeister Dorothea, Bouveret Sylvain, Lang Jérôme, Nguyen Nhan-Tam, Nguyen Trung Thanh et Rothe Jörg (2014). Scoring Rules for the Allocation of Indivisible Goods. In Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14), Prague, Czech Republic. IOS Press.
[Résumé] [BibTeX] [PDF]
We define a family of rules for dividing $m$ indivisible goods among agents, parameterized by a scoring vector and a social welfare aggregation function. We assume that agents' preferences over sets of goods are additive, but that the input is ordinal: each agent simply ranks single goods. Similarly to (positional) scoring rules in voting, a scoring vector $s = \left(s$1, … , sm) consists of $m$ nonincreasing nonnegative weights, where $s$i is the score of a good assigned to an agent who ranks it in position $i$. The global score of an allocation for an agent is the sum of the scores of the goods assigned to her. The social welfare of an allocation is the aggregation of the scores of all agents, for some aggregation function $★$ such as, typically, $+$ or $min$. The rule associated with $s$ and $★$ maps a profile to (one of) the allocation(s) maximizing social welfare. After defining this family of rules, and focusing on some key examples, we investigate some of the social-choice-theoretic properties of this family of rules, such as various kinds of monotonicity, separability, envy-freeness, and Pareto efficiency.
@InProceedings{BBLNNR-ECAI14,
author = 	 {Dorothea Baumeister and Sylvain Bouveret and Jérôme Lang and Nhan-Tam Nguyen and {Trung Thanh} Nguyen and Jörg Rothe},
title = 	 {Scoring Rules for the Allocation of Indivisible Goods},
booktitle =    {Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14)},
year = 	 2014,
month = 	 {August},
publisher =    {{IOS} Press},
abstract =     {We define a family of rules for dividing $m$ indivisible goods among agents, parameterized by a scoring vector and a social welfare aggregation function. We assume that agents' preferences over sets of goods are additive, but that the input is ordinal: each agent simply ranks single goods. Similarly to (positional) scoring rules in voting, a scoring vector $s = (s_1, \ldots , s_m)$ consists of $m$ nonincreasing nonnegative weights, where $s_i$ is the score of a good assigned to an agent who ranks it in position $i$. The global score of an allocation for an agent is the sum of the scores of the goods assigned to her. The social welfare of an allocation is the aggregation of the scores of all agents, for some aggregation function $\star$ such as, typically, $+$ or $\min$. The rule associated with $s$ and $\star$ maps a profile to (one of) the allocation(s) maximizing social welfare.  After defining this family of rules, and focusing on some key examples, we investigate some of the social-choice-theoretic properties of this family of rules, such as various kinds of monotonicity, separability, envy-freeness, and Pareto efficiency.},
url       = {http://recherche.noiraudes.net/resources/papers/ECAI14-2.pdf}
}
WS7Baumeister Dorothea, Bouveret Sylvain, Lang Jérôme, Nguyen Nhan-Tam, Nguyen Trung Thanh, Rothe Jörg et Saffidine Abdallah (2014). Scoring Rules for the Allocation of Indivisible Goods. In Proceedings of the Fifth International Workshop on Computational Social Choice (COMSOC'14), Pittsburgh, Pennsylvania.
[Résumé] [BibTeX] [PDF]
We define a family of rules for dividing $m$ indivisible goods among agents, parameterized by a scoring vector and a social welfare aggregation function. We assume that agents' preferences over sets of goods are additive, but that the input is ordinal: each agent simply ranks single goods. Similarly to (positional) scoring rules in voting, a scoring vector $s = \left(s$1, … , sm) consists of $m$ nonincreasing nonnegative weights, where $s$i is the score of a good assigned to an agent who ranks it in position $i$. The global score of an allocation for an agent is the sum of the scores of the goods assigned to her. The social welfare of an allocation is the aggregation of the scores of all agents, for some aggregation function $★$ such as, typically, $+$ or $min$. The rule associated with $s$ and $★$ maps a profile to (one of) the allocation(s) maximizing social welfare. After defining this family of rules, and focusing on some key examples, we investigate some of the social-choice-theoretic properties of this family of rules, such as various kinds of monotonicity, separability, envy-freeness, and Pareto efficiency.
@InProceedings{BBLNNR-COMSOC14,
type      = {workshop},
author = 	 {Dorothea Baumeister and Sylvain Bouveret and Jérôme Lang and Nhan-Tam Nguyen and {Trung Thanh} Nguyen and Jörg Rothe and Abdallah Saffidine},
title = 	 {Scoring Rules for the Allocation of Indivisible Goods},
booktitle =    {Proceedings of the Fifth International Workshop on Computational Social Choice (COMSOC'14)},
year = 	 2014,
month = 	 {June},
abstract =     {We define a family of rules for dividing $m$ indivisible goods among agents, parameterized by a scoring vector and a social welfare aggregation function. We assume that agents' preferences over sets of goods are additive, but that the input is ordinal: each agent simply ranks single goods. Similarly to (positional) scoring rules in voting, a scoring vector $s = (s_1, \ldots , s_m)$ consists of $m$ nonincreasing nonnegative weights, where $s_i$ is the score of a good assigned to an agent who ranks it in position $i$. The global score of an allocation for an agent is the sum of the scores of the goods assigned to her. The social welfare of an allocation is the aggregation of the scores of all agents, for some aggregation function $\star$ such as, typically, $+$ or $\min$. The rule associated with $s$ and $\star$ maps a profile to (one of) the allocation(s) maximizing social welfare.  After defining this family of rules, and focusing on some key examples, we investigate some of the social-choice-theoretic properties of this family of rules, such as various kinds of monotonicity, separability, envy-freeness, and Pareto efficiency.},
url       = {http://recherche.noiraudes.net/resources/papers/COMSOC14-2.pdf}
}
CH1Bouveret, Sylvain, Lang, Jérôme et Lemaître, Michel (2014). Systèmes Multiagents : Décision Collective. In Marquis, Pierre, Papini, Odile et Prade, Henri, éditeurs, Panorama de l'Intelligence Artificielle, volume 1, Représentation des Connaissances et Formalisation des Raisonnements. Chapitre 15.Cépaduès.
[Résumé] [BibTeX]
Ce chapitre présente deux principaux modèles de la décision collective (multi-agents) : le modèle de base qualitatif (ordinal) et le modèle qualitatif utilitariste (numérique). Trois problèmes emblématiques de la décision collective sont ensuite exposés : le vote ; le partage de biens ou de ressources ; et enfin les enchères.
@InCollection{BLL-CHAPTER-IA14,
author =	 {Sylvain Bouveret and Jérôme Lang and Michel Lemaître},
title =	 {Systèmes Multiagents : Décision Collective},
booktitle =	 {Panorama de l'Intelligence Artificielle},
year =	 2014,
editor =	 {Pierre Marquis and Odile Papini and Henri Prade},
volume =	 {1, Représentation des Connaissances et Formalisation des Raisonnements},
chapter =	 15,
abstract =     {Ce chapitre présente deux principaux modèles de la décision collective (multi-agents) : le modèle de base qualitatif (ordinal) et le modèle qualitatif utilitariste (numérique).  Trois problèmes emblématiques de la décision collective sont ensuite exposés : le vote ; le partage de biens ou de ressources ; et enfin les enchères.}
}

## 2013

CN5Bouveret Sylvain et Lemaître Michel (2013). Mon partage sera-t-il conflictuel ? Une échelle de propriétés pour la caractérisation d'instances de partage de biens indivisibles. In Actes des huitièmes journées francophones Modèles Formels de l'Interaction (MFI'13), Lille, France.
[Résumé] [BibTeX] [PDF]
À partir d'un modèle simple de problème de partage de biens indivisibles avec préférences additives, nous montrons comment une série de cinq propriétés pouvant définir l'équité d'un partage sont connectées entre elles, formant une échelle d'exigences croissantes. Cette échelle permet de caractériser la conflictualité d'une instance de problème de partage : le degré de non-conflit se reflète dans la plus exigeante des propriétés que peut satisfaire un partage de cette instance. Des résultats de complexité théorique concernant ces propriétés sont établis. Le modèle est élargi vers des préférences $k$-additives.
@InProceedings{BL-MFI13,
type      = {confnat},
author    = {Sylvain Bouveret and Michel Lemaître},
title     = {Mon partage sera-t-il conflictuel ? Une échelle de propriétés pour la caractérisation d'instances de partage de biens indivisibles},
booktitle = {Actes des huitièmes journées francophones Modèles Formels de l'Interaction (MFI'13)},
year      = 2013,
month     = {juillet},
abstract  = {À partir d'un modèle simple de problème de partage de biens indivisibles avec préférences additives, nous montrons comment une série de cinq propriétés pouvant définir l'équité d'un partage sont connectées entre elles, formant une échelle d'exigences croissantes. Cette échelle permet de caractériser la conflictualité d'une instance de problème de partage : le degré de non-conflit se reflète dans la plus exigeante des propriétés que peut satisfaire un partage de cette instance. Des résultats de complexité théorique concernant ces propriétés sont établis. Le modèle est élargi vers des préférences $k$-additives.},
url       = {http://recherche.noiraudes.net/resources/papers/MFI13.pdf},
}
WS6Baumeister Dorothea, Bouveret Sylvain, Lang Jérôme, Nguyen Trung Thanh, Rothe Jörg et Saffidine Abdallah (2013). Positional Scoring Rules for the Allocation of Indivisible Goods. In Proceedings of the 11th European Workshop on Multi-Agent Systems (EUMAS'13), Toulouse, France.
[Résumé] [BibTeX] [PDF]
We define a family of rules for dividing $m$ indivisible goods among agents, parameterized by a scoring vector and a social welfare aggregation function. We assume that agents' preferences over sets of goods are additive, but that the input is ordinal: each agent simply ranks single goods. Similarly to positional scoring voting rules in voting, a scoring vector $s = \left(s$1, … , sm) consists of $m$ nonincreasing nonnegative weights, where $s$i is the score of a good assigned to an agent who ranks it in position $i$. The global score of an allocation for an agent is the sum of the scores of the goods assigned to her. The social welfare of an allocation is the aggregation of the scores of all agents, for some aggregation function $★$ such as, typically, $+$ or $min$. The rule associated with $s$ and $★$ maps a profile of individual rankings over goods to (one of) the allocation(s) maximizing social welfare. After defining this family of rules and discussing some of their properties, we focus on the computation and approximation of winning allocations.
@InProceedings{BBLNRS-EUMAS13,
type      = {workshop},
author    = {Dorothea Baumeister and Sylvain Bouveret and Jérôme Lang and {Trung Thanh} Nguyen and Jörg Rothe and Abdallah Saffidine},
title     = {Positional Scoring Rules for the Allocation of Indivisible Goods},
booktitle = {Proceedings of the 11th European Workshop on Multi-Agent Systems (EUMAS'13)},
year      = 2013,
month     = {December},
abstract  = {We define a family of rules for dividing $m$ indivisible goods among agents, parameterized by a scoring vector and a social welfare aggregation function. We assume that agents' preferences over sets of goods are additive, but that the input is ordinal: each agent simply ranks single goods. Similarly to positional scoring voting rules in voting, a scoring vector $s = (s_1, \ldots , s_m)$ consists of $m$ nonincreasing nonnegative weights, where $s_i$ is the score of a good assigned to an agent who ranks it in position $i$. The global score of an allocation for an agent is the sum of the scores of the goods assigned to her. The social welfare of an allocation is the aggregation of the scores of all agents, for some aggregation function $\star$ such as, typically, $+$ or $\min$. The rule associated with $s$ and $\star$ maps a profile of individual rankings over goods to (one of) the allocation(s) maximizing social welfare. After defining this family of rules and discussing some of their  properties, we focus on the computation and approximation of winning allocations.
},
url       = {http://recherche.noiraudes.net/resources/papers/EUMAS13.pdf},
}

## 2012

C8Lumet Charles, Bouveret Sylvain et Lemaître Michel (2012). Fair division of indivisible goods under risk. In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI'12), Montpellier, France. IOS Press.
[Résumé] [BibTeX] [PDF]
We consider the problem of fairly allocating a set of $m$ indivisible objects to $n$ agents having additive preferences over them. In this paper we propose an extension of this classical problem, where each object can possibly be in bad condition (e.g broken), in which case its actual value is zero. We assume that the central authority in charge of allocating the objects does not know beforehand the objects conditions, but only has probabilistic information. The aim of this work is to propose a formal model of this problem, to adapt some classical fairness criteria to this extended setting, and to introduce several approaches to compute optimal allocations for small instances as well as suboptimal good allocations for real-world inspired allocation problems of realistic size.
@InProceedings{LBL-ECAI12,
author    = {Charles Lumet and Sylvain Bouveret and Michel Lemaître},
title     = {Fair division of indivisible goods under risk},
booktitle = {Proceedings of the 20th European Conference on Artificial Intelligence (ECAI'12)},
year      = 2012,
month     = {August},
publisher = {{IOS} Press},
abstract  = {We consider the problem of fairly allocating a set of $m$ indivisible objects to $n$ agents having additive preferences over them. In this paper we propose an extension of this classical problem, where each object can possibly be in bad condition (\textit{e.g} broken), in which case its actual value is zero. We assume that the central authority in charge of allocating the objects does not know beforehand the objects conditions, but only has probabilistic information. The aim of this work is to propose a formal model of this problem, to adapt some classical fairness criteria to this extended setting, and to introduce several approaches to compute optimal allocations for small instances as well as suboptimal good allocations for real-world inspired allocation problems of realistic size.},
url       = {http://recherche.noiraudes.net/resources/papers/ECAI12.pdf}
}

## 2011

CN4Lumet Charles, Bouveret Sylvain et Lemaître Michel (2011). Partage équitable de biens indivisibles sous risque. In Actes des septièmes journées francophones Modèles Formels de l'Interaction (MFI'11), Rouen, France.
[Résumé] [BibTeX] [PDF]
Cet article concerne le problème de partage équitable d'objets indivisibles entre des agents ayant des préférences additives sur ces objets. Nous nous intéressons au cas où chaque objet peut être dans deux états possibles : normal ou dégradé. Nous supposons de plus que l'état réel des objets n'est pas connu au moment du partage, mais que le décideur connaît la probabilité pour chaque objet d'être normal ou dégradé. Nous proposons un modèle formel de ce problème s'appuyant sur les notions d'équité ex-ante et ex-post, et nous proposons des algorithmes de calcul de partages optimaux au sens de l'égalitarisme ex-post que nous évaluons sur des jeux d'instances aléatoires.
@InProceedings{LBL-MFI11,
type      = {confnat},
author    = {Charles Lumet and Sylvain Bouveret and Michel Lemaître},
title     = {Partage équitable de biens indivisibles sous risque},
booktitle = {Actes des septièmes journées francophones Modèles Formels de l'Interaction (MFI'11)},
year      = 2011,
month     = {juin},
abstract  = {Cet article concerne le problème de partage équitable d'objets indivisibles entre des agents ayant des préférences additives sur ces objets. Nous nous intéressons au cas où chaque objet peut être dans deux états possibles : normal ou dégradé. Nous supposons de plus que l'état réel des objets n'est pas connu au moment du partage, mais que le décideur connaît la probabilité pour chaque objet d'être normal ou dégradé. Nous proposons un modèle formel de ce problème s'appuyant sur les notions d'équité \textit{ex-ante} et \textit{ex-post}, et nous proposons des algorithmes de calcul de partages optimaux au sens de l'égalitarisme \textit{ex-post} que nous évaluons sur des jeux d'instances aléatoires.},
url       = {http://recherche.noiraudes.net/resources/papers/MFI11.pdf},
}
WS5Lumet Charles, Bouveret Sylvain et Lemaître Michel (2011). Fair division of indivisible goods under risk. In Proceedings of the IJCAI-2011 Workshop on Social Choice and Artificial Intelligence, Barcelona, Spain.
[Résumé] [BibTeX] [PDF]
We study the problem of fairly allocating a set of indivisible goods to a set of agents having additive preferences. More precisely, we consider the problem in which each object can be in two possible states: good or bad. We further assume that the actual object state is not known at the allocation time, but that the decision-maker knows the probability for each object to be in each state. We propose a formal model of this problem, based on the notions of ex-ante and ex-post fairness, and we propose some algorithms aiming at computing optimal allocations in the sense of ex-post egalitarianism, the efficiency of these algorithms being tested on random instances.
@InProceedings{LBL-WSCAI11,
type      = {workshop},
author    = {Charles Lumet and Sylvain Bouveret and Michel Lemaître},
title     = {Fair division of indivisible goods under risk},
booktitle = {Proceedings of the IJCAI-2011 Workshop on Social Choice and Artificial Intelligence},
year      = 2011,
month     = {July},
abstract  = {We study the problem of fairly allocating a set of indivisible goods to a set of agents having additive preferences. More precisely, we consider the problem in which each object can be in two possible states: good or bad. We further assume that the actual object state is not known at the allocation time, but that the decision-maker knows the probability for each object to be in each state. We propose a formal model of this problem, based on the notions of \textit{ex-ante} and \textit{ex-post} fairness, and we propose some algorithms aiming at computing optimal allocations in the sense of \textit{ex-post} egalitarianism, the efficiency of these algorithms being tested on random instances.},
url       = {http://recherche.noiraudes.net/resources/papers/WSCAI11.pdf},
editors   = {Edith Elkind and Ulle Endriss and Jérôme Lang}
}
WS4Bouveret Sylvain, Brunel Julien, Chemouil David et Dagnat Fabien (2011). Towards a categorical framework to ensure correct software evolutions. In Proceedings of the Third Workshop on Hot Topics in Software Upgrades (HotSWUp'11), Hannover, Germany.
[Résumé] [BibTeX] [PDF]
Distributed software, such as satellite software are now developed and managed by several actors. In this context supporting the maintenance and therefore the evolution of such applications is complex and need a formal framework. In this article, we propose a first step towards such a formal framework to ensure the correctness of software evolutions. Using category theory, we can model software and represent patches. This modeling allows to identify the proof obligations that the provider of a patch has to discharge in order to ensure that its patch preserves the correctness of the software.
@InProceedings{BBDD-HOTSWUP11,
type      = {workshop},
author    = {Sylvain Bouveret and Julien Brunel and David Chemouil and Fabien Dagnat},
title     = {Towards a categorical framework to ensure correct software evolutions},
booktitle = {Proceedings of the Third Workshop on Hot Topics in Software Upgrades (HotSWUp'11)},
year      = 2011,
month     = {April},
abstract  = {Distributed software, such as satellite software are now developed and managed by several actors. In this context supporting the maintenance and therefore the evolution of such applications is complex and need a formal framework. In this article, we propose a  first step towards such a formal framework to ensure the correctness of software evolutions. Using category theory, we can model software and represent patches. This modeling allows to identify the proof obligations that the provider of a patch has to discharge in order to ensure that its patch preserves the correctness of the software.},
url       = {http://recherche.noiraudes.net/resources/papers/HOTSWUP11.pdf}
}
C7Bouveret Sylvain et Lang Jérôme (2011). A general elicitation-free protocol for allocating indivisible goods. In Proceedings of the 22st International Joint Conference on Artificial Intelligence (IJCAI'11), Barcelona, Spain.
[Résumé] [BibTeX] [PDF]
We consider the following sequential allocation process. A benevolent central authority has to allocate a set of indivisible goods to a set of agents whose preferences it is totally ignorant of. We consider the process of allocating objects one after the other by designating an agent and asking her to pick one of the objects among those that remain. The problem consists in choosing the "best" sequence of agents, according to some optimality criterion. We assume that agents have additive preferences over objects. The choice of an optimality criterion depends on three parameters: how utilities of objects are related to their ranking in an agent's preference relation; how the preferences of different agents are correlated; and how social welfare is defined from the agents' utilities. We address the computation of a sequence maximizing expected social welfare under several assumptions. We also address strategical issues.
@InProceedings{BL-IJCAI11,
author    = {Sylvain Bouveret and Jérôme Lang},
title     = {A general elicitation-free protocol for allocating indivisible goods},
booktitle = {Proceedings of the 22st International Joint Conference on Artificial Intelligence (IJCAI'11)},
year      = 2011,
month     = {July},
abstract  = {We consider the following sequential allocation process. A benevolent central authority has to allocate a set of indivisible goods to a set of agents whose preferences it is totally ignorant of. We consider the process of allocating objects one after the other by designating an agent and asking her to pick one of the objects among those that remain. The problem consists in choosing the "best" sequence of agents, according to some optimality criterion. We assume that agents have additive preferences over objects. The choice of an optimality criterion depends on three parameters: how utilities of objects are related to their ranking in an agent's preference relation; how the preferences of different agents are correlated; and how social welfare is defined from the agents' utilities. We address the computation of a sequence maximizing expected social welfare under several assumptions. We also address strategical issues.},
url       = {http://recherche.noiraudes.net/resources/papers/IJCAI11.pdf},
}

## 2010

C6Bouveret Sylvain, Endriss Ulle et Lang Jérôme (2010). Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods. In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI'10), Lisbon, Portugal. IOS Press.
[Résumé] [BibTeX] [PDF]
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (rather than utility functions) and when our knowledge of those preferences is incomplete. The incompleteness of the preferences stems from the fact that each agent reports their preferences by means of an expression of bounded size in a compact preference representation language. Specifically, we assume that each agent only provides a ranking of individual goods (rather than of bundles). In this context, we consider the algorithmic problem of deciding whether there exists an allocation that is possibly (or necessarily) envy-free, given the incomplete preference information available, if in addition some mild economic efficiency criteria need to be satisfied. We provide simple characterisations, giving rise to simple algorithms, for some instances of the problem, and computational complexity results, establishing the intractability of the problem, for others.
@InProceedings{BEL-ECAI10,
author    = {Sylvain Bouveret and Ulle Endriss and Jérôme Lang},
title     = {Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods},
booktitle = {Proceedings of the 19th European Conference on Artificial Intelligence (ECAI'10)},
year      = 2010,
month     = {August},
publisher = {{IOS} Press},
abstract  = {We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (rather than utility functions) and when our knowledge of those preferences is incomplete. The incompleteness of the preferences stems from the fact that each agent reports their preferences by means of an expression of bounded size in a compact preference representation language. Specifically, we assume that each agent only provides a ranking of individual goods (rather than of bundles). In this context, we consider the algorithmic problem of deciding whether there exists an allocation that is possibly (or necessarily) envy-free, given the incomplete preference information available, if in addition some mild economic efficiency criteria need to be satisfied. We provide simple characterisations, giving rise to simple algorithms, for some instances of the problem, and computational complexity results, establishing the intractability of the problem, for others.
},
url       = {http://recherche.noiraudes.net/resources/papers/ECAI10.pdf}
}
WS3Bouveret Sylvain, Endriss Ulle et Lang Jérôme (2010). Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods. In Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC'10), Düsseldorf, Germany.
[Résumé] [BibTeX] [PDF]
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (rather than utility functions) and when our knowledge of those preferences is incomplete. The incompleteness of the preferences stems from the fact that each agent reports their preferences by means of an expression of bounded size in a compact preference representation language. Specifically, we assume that each agent only provides a ranking of individual goods (rather than of bundles). In this context, we consider the algorithmic problem of deciding whether there exists an allocation that is possibly (or necessarily) envy-free, given the incomplete preference information available, if in addition some mild economic efficiency criteria need to be satisfied. We provide simple characterisations, giving rise to simple algorithms, for some instances of the problem, and computational complexity results, establishing the intractability of the problem, for others.
@InProceedings{BEL-COMSOC10,
type      = {workshop},
author    = {Sylvain Bouveret and Ulle Endriss and Jérôme Lang},
title     = {Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods},
booktitle = {Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC'10)},
year      = 2010,
month     = {September},
abstract  = {We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (rather than utility functions) and when our knowledge of those preferences is incomplete. The incompleteness of the preferences stems from the fact that each agent reports their preferences by means of an expression of bounded size in a compact preference representation language. Specifically, we assume that each agent only provides a ranking of individual goods (rather than of bundles). In this context, we consider the algorithmic problem of deciding whether there exists an allocation that is possibly (or necessarily) envy-free, given the incomplete preference information available, if in addition some mild economic efficiency criteria need to be satisfied. We provide simple characterisations, giving rise to simple algorithms, for some instances of the problem, and computational complexity results, establishing the intractability of the problem, for others.
},
url       = {http://recherche.noiraudes.net/resources/papers/COMSOC10.pdf}
}

## 2009

C5Keijzer Bart, Bouveret Sylvain, Klos Tomas et Zhang Yingqian (2009). On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences. In Proceedings of the 1st International Conference on Algorithmic Decision Theory (ADT'09), Venice, Italy. Springer Verlag.
[Résumé] [BibTeX] [PDF]
We study the problem of allocating a set of indivisible goods to a set of agents having additive preferences. We introduce two new important complexity results concerning efficiency and fairness in resource allocation problems: we prove that the problem of deciding whether a given allocation is Pareto-optimal is coNP-complete, and that the problem of deciding whether there is a Pareto-efficient and envy-free allocation is $\Sigma$2p-complete.
@InProceedings{KBKZ-ADT09,
author    = {Bart {de Keijzer} and Sylvain Bouveret and Tomas Klos and Yingqian Zhang},
title     = {On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences},
booktitle = {Proceedings of the 1st International Conference on Algorithmic Decision Theory (ADT'09)},
year      = 2009,
series    = {Lecture Notes in Artificial Intelligence},
month     = {October},
publisher = {Springer Verlag},
abstract  = {We study the problem of allocating a set of indivisible goods to a set of agents having additive preferences. We introduce two new important complexity results concerning efficiency and fairness in resource allocation problems: we prove that the problem of deciding whether a given allocation is Pareto-optimal is \textsf{coNP}-complete, and that the problem of deciding whether there is a Pareto-efficient and envy-free allocation is $\Sigma_2^p$-complete.},
}
C4Bouveret Sylvain, Endriss Ulle et Lang Jérôme (2009). Conditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI'09), Pasadena, California, USA.
[Résumé] [BibTeX] [PDF]
While there are several languages for representing combinatorial preferences over sets of alternatives, none of these are well-suited to the representation of ordinal preferences over sets of goods (which are typically required to be monotonic). We propose such a language, taking inspiration from previous work on graphical languages for preference representation, specifically CP-nets, and introduce conditional importance networks (CI-nets). A CI-net includes statements of the form "if I have a set A of goods, and I do not have any of the goods from some other set B, then I prefer the set of goods C over the set of goods D." We investigate expressivity and complexity issues for CI-nets. Then we show that CI-nets are well-suited to the description of fair division problems.
@InProceedings{BEL-IJCAI09,
author    = {Sylvain Bouveret and Ulle Endriss and Jérôme Lang},
title     = {Conditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods},
booktitle = {Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI'09)},
pages     = {67-72},
year      = 2009,
month     = {July},
abstract  = {While there are several languages for representing combinatorial preferences over sets of alternatives, none of these are well-suited to the representation of ordinal preferences over sets of goods (which are typically required to be monotonic). We propose such a language, taking inspiration from previous work on graphical languages for preference representation, specifically CP-nets, and introduce conditional importance networks (CI-nets). A CI-net includes statements of the form "if I have a set A of goods, and I do not have any of the goods from some other set B, then I prefer the set of goods C over the set of goods D." We investigate expressivity and complexity issues for CI-nets. Then we show that CI-nets are well-suited to the description of fair division problems.},
url       = {http://www.ijcai.org/Proceedings/09/Papers/022.pdf}
}
J2Bouveret, Sylvain et Lemaître, Michel (2009). Computing leximin-optimal solutions in constraint networks. In Artificial Intelligence, 173(2): 343-364.
[Résumé] [BibTeX] [URL]
In many real-world multiobjective optimization problems one needs to find solutions or alternatives that provide a fair compromise between different conflicting objective functions--which could be criteria in a multicriteria context, or agent utilities in a multiagent context--while being efficient (i.e. informally, ensuring the greatest possible overall agents' satisfaction). This is typically the case in problems implying human agents, where fairness and efficiency requirements must be met. Preference handling, resource allocation problems are another examples of the need for balanced compromises between several conflicting objectives. A way to characterize good solutions in such problems is to use the leximin preorder to compare the vectors of objective values, and to select the solutions which maximize this preorder. In this article, we describe five algorithms for finding leximin-optimal solutions using constraint programming. Three of these algorithms are original. Other ones are adapted, in constraint programming settings, from existing works. The algorithms are compared experimentally on three benchmark problems.
@article{BL-AIJ09,
author    = {Sylvain Bouveret and Michel Lemaître},
title     = {Computing leximin-optimal solutions in constraint networks},
journal   = {Artificial Intelligence},
volume    = {173},
number    = {2},
pages     = {343-364},
year      = {2009},
issn      = {0004-3702},
doi       = {DOI: 10.1016/j.artint.2008.10.010},
abstract  = {In many real-world multiobjective optimization problems one needs to find solutions or alternatives that provide a fair compromise between different conflicting objective functions--which could be criteria in a multicriteria context, or agent utilities in a multiagent context--while being efficient (i.e. informally, ensuring the greatest possible overall agents' satisfaction). This is typically the case in problems implying human agents, where fairness and efficiency requirements must be met. Preference handling, resource allocation problems are another examples of the need for balanced compromises between several conflicting objectives. A way to characterize good solutions in such problems is to use the leximin preorder to compare the vectors of objective values, and to select the solutions which maximize this preorder. In this article, we describe five algorithms for finding leximin-optimal solutions using constraint programming. Three of these algorithms are original. Other ones are adapted, in constraint programming settings, from existing works. The algorithms are compared experimentally on three benchmark problems.}
}

## 2008

J1Bouveret, Sylvain et Lang, Jérôme (2008). Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity. In Journal of Artificial Intelligence Research (JAIR), 32: 525-564.
[Résumé] [BibTeX] [URL]
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by assuming that agents have dichotomous preferences expressed by propositional formulae. We express efficiency and envy-freeness in a logical setting, which reveals unexpected connections to nonmonotonic reasoning. Then we identify the complexity of determining whether there exists an efficient and envy-free allocation, for several notions of efficiency, when preferences are represented in a succinct way (as well as restrictions of this problem). We first study the problem under the assumption that preferences are dichotomous, and then in the general case.
@article{BL-JAIR08,
author    = {Sylvain Bouveret and Jérôme Lang},
title     = {Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity},
journal   = {Journal of Artificial Intelligence Research (JAIR)},
volume    = {32},
year      = {2008},
pages     = {525-564},
abstract  = {We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by assuming that agents have dichotomous preferences expressed by propositional formulae. We express efficiency and envy-freeness in a logical setting, which reveals unexpected connections to nonmonotonic reasoning. Then we identify the complexity of determining whether there exists an efficient and envy-free allocation, for several notions of efficiency, when preferences are represented in a succinct way (as well as restrictions of this problem). We first study the problem under the assumption that preferences are dichotomous, and then in the general case.}
}

## 2007

C3Bouveret Sylvain et Lemaître Michel (2007). New Constraint Programming Approaches for the Computation of Leximin-Optimal Solutions in Constraint Networks. In Veloso, Manuela M., éditeurs, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'07), Hyderabad, India.
[Résumé] [BibTeX] [PDF]
We study the problem of computing a leximin-optimal solution of a constraint network. This problem is highly motivated by fairness and efficiency requirements in many real-world applications implying human agents. We compare several generic algorithms which solve this problem in a constraint programming framework. The first one is entirely original, and the other ones are partially based on existing works adapted to fit with this problem.
@inproceedings{BL-IJCAI07,
author    = {Sylvain Bouveret and
Michel Lemaître},
title     = {New Constraint Programming Approaches for the Computation
of Leximin-Optimal Solutions in Constraint Networks},
editor    = {Manuela M. Veloso},
booktitle = {Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'07)},
year      = {2007},
month     = {January},
pages     = {62-67},
url       = {http://www.ijcai.org/Proceedings/07/Papers/008.pdf},
abstract  = {We study the problem of computing a leximin-optimal solution of a constraint network. This problem is highly motivated by fairness and efficiency requirements in many real-world applications implying human agents. We compare several generic algorithms which solve this problem in a constraint programming framework. The first one is entirely original, and the other ones are partially based on existing works adapted to fit with this problem.}
}
CN3Bouveret Sylvain et Lemaître Michel (2007). Fonctions d'utilité collective avec droits exogènes inégaux. In Paschos, Vangelis et Roy, Bernard, éditeurs, Actes des cinquièmes journées francophones Modèles Formels de l'Interaction (MFI'07), Paris, France. Université Paris IX Dauphine.
[Résumé] [BibTeX] [PDF]
On s'intéresse à la prise de décision collective et coopérative dans un groupe d'agents ayant des préférences individuelles s'exprimant par des utilités numériques. Dans ce modèle, les préférences des agents sont agrégées en une préférence commune à l'aide d'une fonction d'utilité collective, traduisant ainsi de manière formelle le critère « éthique » choisi par la collectivité. La plupart des travaux issus du choix social supposent que les agents sont égaux a priori vis-à-vis de la prise de décision, mais ce n'est pas toujours le cas pour des problèmes réels. Nous nous intéressons à la construction et à l'étude de fonctions d'utilité collective prenant en compte ces droits inégaux.
@InProceedings{BL-MFI07,
type      = {confnat},
author    = {Sylvain Bouveret and Michel Lemaître},
title     = {Fonctions d'utilité collective avec droits exogènes inégaux},
booktitle = {Actes des cinquièmes journées francophones Modèles Formels de l'Interaction (MFI'07)},
year      = {2007},
editor    = {Vangelis Paschos and Bernard Roy},
month     = {mai},
publisher = {Université Paris IX Dauphine},
url       = {http://recherche.noiraudes.net/resources/papers/MFI07.pdf}
note      = {(in french)},
abstract  = {On s'intéresse à la prise de décision collective et coopérative dans un groupe d'agents ayant des préférences individuelles s'exprimant par des utilités numériques. Dans ce modèle, les préférences des agents sont agrégées en une préférence commune à l'aide d'une fonction d'utilité collective, traduisant ainsi de manière formelle le critère « éthique » choisi par la collectivité. La plupart des travaux issus du choix social supposent que les agents sont égaux a priori vis-à-vis de la prise de décision, mais ce n'est pas toujours le cas pour des problèmes réels. Nous nous intéressons à la construction et à l'étude de fonctions d'utilité collective prenant en compte ces droits inégaux.},
}

## 2006

CN2Bouveret Sylvain et Lemaître Michel (2006). Un algorithme de programmation par contraintes pour la recherche d'allocations leximin-optimales. In AFPC, éditeurs, Actes des deuxièmes Journées Francophones de Programmation par Contraintes (JFPC'06), Nîmes, France.
[Résumé] [BibTeX] [PDF]
Dans le cadre de la programmation par contraintes, nous proposons un algorithme résolvant le problème suivant : allouer d'une manière équitable et efficace un ensemble fini d'objets à des agents ayant chacun leurs utilités propres, sous des contraintes d'admissibilité. L'algorithme calcule une allocation maximisant l'ordre leximin sur les profils d'utilités des agents. Nous décrivons de plus le domaine d'application qui a motivé ces travaux : le partage de ressources satellitaires. Nous en extrayons un problème simple et précis d'allocation équitable, qui nous sert de base, grâce à un générateur de jeux de tests, pour l'évaluation de l'algorithme proposé. Deux implantations de l'algorithme sont comparées, l'une en programmation par contrainte « pure », avec Choco, l'autre en programmation linéaire mixte avec Cplex.
@InProceedings{BL-JFPC06,
type      = {confnat},
author    = {Sylvain Bouveret and Michel Lemaître},
title     = {Un algorithme de programmation par contraintes pour la recherche d'allocations leximin-optimales},
booktitle = {Actes des deuxièmes Journées Francophones de Programmation par Contraintes (JFPC'06)},
year      = {2006},
editor    = {AFPC},
month     = {juin},
url       = {http://recherche.noiraudes.net/resources/papers/JFPC06.pdf}
note      = {(in french)},
abstract  = {Dans le cadre de la programmation par contraintes, nous proposons un algorithme résolvant le problème suivant : allouer d'une manière équitable et efficace un ensemble fini d'objets à des agents ayant chacun leurs utilités propres, sous des contraintes d'admissibilité. L'algorithme calcule une allocation maximisant l'ordre leximin sur les profils d'utilités des agents. Nous décrivons de plus le domaine d'application qui a motivé ces travaux : le partage de ressources satellitaires. Nous en extrayons un problème simple et précis d'allocation équitable, qui nous sert de base, grâce à un générateur de jeux de tests, pour l'évaluation de l'algorithme proposé. Deux implantations de l'algorithme sont comparées, l'une en programmation par contrainte « pure », avec Choco, l'autre en programmation linéaire mixte avec Cplex.},
}
WS2Bouveret Sylvain et Lemaître Michel (2006). Finding leximin-optimal solutions using constraint programming: new algorithms and their application to combinatorial auctions. In Endriss, Ulle et Lang, Jérôme, éditeurs, Proceedings of the 1st International Workshop on Computational Social Choice (COMSOC'06), ILLC, University of Amsterdam.
[Résumé] [BibTeX] [PDF]
We study the problem of computing a leximin-optimal solution of a constraint network. This problem is highly motivated by fairness and efficiency requirements in many real-world applications implying human agents. We compare several generic algorithms which solve this problem in a constraint programming framework. The second one is entirely original, and the other ones are partially based on existing works adapted to fit with this problem. These algorithms are tested on combinatorial auctions instances.
@InProceedings{BL-COMSOC06,
type      = {workshop},
author    = {Sylvain Bouveret and Michel Lemaître},
title     = {Finding leximin-optimal solutions using constraint programming: new algorithms and their application to combinatorial auctions},
booktitle = {Proceedings of the 1st International Workshop on Computational Social Choice (COMSOC'06)},
year      = 2006,
editor    = {Ulle Endriss and Jérôme Lang},
address   = {ILLC, University of Amsterdam},
month     = {December},
url       = {http://staff.science.uva.nl/~ulle/COMSOC-2006/papers/30-bouveret.pdf},
abstract  = {We study the problem of computing a leximin-optimal solution of a constraint network. This problem is highly motivated by fairness and efficiency requirements in many real-world applications implying human agents. We compare several generic algorithms which solve this problem in a constraint programming framework. The second one is entirely original, and the other ones are partially based on existing works adapted to fit with this problem. These algorithms are tested on combinatorial auctions instances.},
}
WS1Bouveret Sylvain et Lemaître Michel (2006). Comparison of two constraint programming algorithms for computing leximin-optimal allocations. In Prestwich, Steven et Hnich, Brahim, éditeurs, Proceedings the workshop on Modelling and Solving Problems with Constraints, ECAI'06, Riva del Garda, Italy.
[Résumé] [BibTeX] [PDF]
@InProceedings{BL-ECAIWS06,
type      = {workshop},
author    = {Sylvain Bouveret and Michel Lemaître},
title     = {Comparison of two constraint programming algorithms for computing leximin-optimal allocations},
booktitle = {Proceedings the workshop on Modelling and Solving Problems with Constraints, ECAI'06},
editor    = {Steven Prestwich and Brahim Hnich},
year      = {2006},
address   = {Riva del Garda, Italy},
month     = {August},
url       = {http://recherche.noiraudes.net/resources/papers/ECAI06.pdf}
abstract  = {We propose two constraint programming algorithms for solving the following problem: fairly and efficiently allocate a finite set of objects to a set of agents, each one having their own utilities, under admissibility constraints. Our algorithms compute an allocation maximizing the leximin order on the utility profiles of the agents. Our main contribution is the use of a cardinality meta-constraint on the one hand, and an adaptation of an existing algorithm for enforcing a multiset ordering constraint on the other hand. Moreover, we describe the application domain that motivated this work: sharing of satellite resources. We extract from this real-world application a simple and precise fair allocation problem that allows for testing and evaluating our algorithms, using a benchmark generator. The implementations of both algorithms have been tested using the constraints programming tool Choco, and a translation of the first algorithm to integer linear programming has been tested using Cplex.},
}

## 2005

CN1Bouveret Sylvain, Fargier Hélène, Lang Jérôme et Lemaître Michel (2005). Un modèle général et des résultats de complexité pour le partage de biens indivisibles. In Herzig, Andreas, Lespérance, Yves et Mouaddib, Abdel-Illah, éditeurs, Actes des troisièmes journées francophones Modèles Formels de l'Interaction (MFI'05), Caen, France. Cépaduès Éditions.
[Résumé] [BibTeX] [PDF]
@
C2Bouveret Sylvain et Lang Jérôme (2005). Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. In Kaelbling, Leslie Pack et Saffiotti, Alessandro, éditeurs, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), Edinburgh, Scotland. Professional Book Center.
[Résumé] [BibTeX] [PDF]
We study fair division of indivisible goods among agents from the point of view of compact representation and computational complexity. We identify the complexity of several problems, including that of deciding whether there exists an efficient and envy-free allocation when preferences are represented in a succinct way. We also draw connections to nonmonotonic reasoning.
@inproceedings{BL-IJCAI05,
author    = {Sylvain Bouveret and
Jérôme Lang},
title     = {Efficiency and envy-freeness in fair division of indivisible
goods: logical representation and complexity},
pages     = {935-940},
editor    = {Leslie Pack Kaelbling and
Alessandro Saffiotti},
booktitle = {Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05)},
month     = {July},
publisher = {Professional Book Center},
year      = {2005},
url       = {http://www.ijcai.org/Proceedings/05/Papers/0656.pdf},
abstract = {We study fair division of indivisible goods among agents from the point of view of compact representation and computational complexity. We identify the complexity of several problems, including that of deciding whether there exists an efficient and envy-free allocation when preferences are represented in a succinct way. We also draw connections to nonmonotonic reasoning.}
}
C1Bouveret Sylvain, Lemaître Michel, Fargier Hélène et Lang Jérôme (2005). Allocation of indivisible goods: a general model and some complexity results. In Dignum, Frank, Dignum, Virginia, Koenig, Sven, Kraus, Sarit, Singh, Munindar P. et Wooldridge, Michael, éditeurs, 4rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'05), Utrecht, The Netherlands. ACM. (short paper).
[Résumé] [BibTeX] [URL]
Many industrial or research activities are so expensive that it is often benefitable for the involved agents to cofund the construction or the purchase of a common required resource. This resource will then be exploited in common, therefore in a shared way. The rules for resource sharing should take account of the possibly antagonistic preferences: each agent wants to maximize its own satisfaction, whereas, from the collective point of view, decisions which both are equitable and exploit the resources in an optimal way are looked for. We give in this article a formal model for indivisible goods resource sharing without monetary compensations and with arbitrary admissibility constraints. We also give some complexity results about this model. The model is applied to a real-world case, namely satellite resource sharing.
@inproceedings{BLFL-AAMAS05,
author    = {Sylvain Bouveret and
Michel Lemaître and
Hélène Fargier and
Jérôme Lang},
title     = {Allocation of indivisible goods: a general model and some
complexity results},
editor    = {Frank Dignum and
Virginia Dignum and
Sven Koenig and
Sarit Kraus and
Munindar P. Singh and
Michael Wooldridge},
booktitle = {4rd International Joint Conference on Autonomous Agents
and Multiagent Systems (AAMAS'05)},
}