CoCoRICo-CoDec
CoCoRICo

Publications

  • Stéphane Airiau, Umberto Grandi, Filipo Studzinski Perotto: Learning Agents for Iterative Voting. ADT 2017: 139-152
  • Georgios Amanatidis, Nathanaël Barrot, Jérôme Lang, Evangelos Markakis, and Bernard Ries. Multiple referenda and multiwinner elections using hamming distances: Complexity and manipulability. In Proceedings of the 2015 International Conference on Autonomous Agents and Multi-agent Systems, pages 715–723. International Foundation for Autonomous Agents and Multiagent Systems, 2015.
  • Nicolas Gabriel Andjiga, Sébastien Courtin: Coalition configurations and share functions. Annals OR 225(1): 3-25 (2015)
  • Eric Angel, Evripidis Bampis, Fanny Pascual, and Nicolas Thibault. Truthfulness for the sum of weighted completion times. In Computing and Combinatorics - 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings, pages 15–26, 2016.
  • Luciana Arantes, Evripidis Bampis, Alexander V. Kononov, Manthos Letsios, Giorgio Lucarelli, Pierre Sens: Scheduling under Uncertainty: A Query-based Approach, IJCAI-ECAI 2018.
  • Vincenzo Auletta, Angelo Fanelli, Diodato Ferraioli: Consensus in Opinion Formation Processes in Fully Evolving Environments. AAAI-19.
  • Manel Ayadi, Nahla Ben Amor, Jérôme Lang: The Communication Burden of Single Transferable Vote, in Practice. SAGT 2018: 251-255.
  • Manel Ayadi, Nahla Ben Amor, Jérôme Lang, Dominik Peters: Single Transferable Vote: Incomplete Knowledge and Communication Issues. AAMAS 2019: 1288-1296
  • Haris Aziz, Péter Biro, Jérôme Lang, Julien Lesca, and Jérôme Monnot. Optimal reallocation under additive and ordinal preferences. In Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, pages 402–410. International Foundation for Autonomous Agents and Multiagent Systems, 2016. 

  • Haris Aziz, Sylvain Bouveret, Jérôme Lang, and Simon Mackenzie. Complexity of manipulating sequential allocation. In Proceedings of the Thirty- First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., pages 328–334, 2017. 

  • Haris Aziz, Sylvain Bouveret, Ioannis Caragiannis, Ira Giagkousi and Jérôme Lang: Knowledge, Fairness, and Social Constraints. AAAI 2018: 4638-4645
  • Haris Aziz, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jérôme Lang, and Hans Georg Seedig. Possible and necessary winners of partial tournaments. J. Artif. Intell. Res. (JAIR), 54:493–534, 2015. 

  • Haris Aziz, Paul Harrenstein, Jérôme Lang, and Michael Wooldridge. Boolean hedonic games. In Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, pages 166–175, 2016. 

  • Haris Aziz, Jérôme Lang, and Jérôme Monnot. Computing Pareto optimal committees. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, pages 60–66, 2016. 

  • Haris Aziz, Sylvain Bouveret, Ioannis Caragiannis, Ira Giagkousi, Jérôme Lang: Knowledge, Fairness, and Social Constraints. AAAI 2018.
  • Haris Aziz, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot: Efficient reallocation under additive and responsive preferences. ''Theor. Comput. Sci.ee 790: 1-15 (2019).
  • Stéphane Airiau, Haris Aziz, Ioannis Caragiannis, Justin Kruger, Jérôme Lang, Dominik Peters: Portioning Using Ordinal Preferences: Fairness and Efficiency. IJCAI 2019: 11-17.
  • Evripidis Bampis, Bruno Escoffier, Sasa Mladenovic: Fair Resource Allocation Over Time, AAMAS 2018
  • Nathanaël Barrot and Jérôme Lang. Conditional and sequential approval voting on combinatorial domains. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, pages 88–94, 2016. 

  • Nathanaël Barrot, Jérôme Lang and Makoto Yokoo: Manipulation of Hamming-based Approval Voting for Multiple Referenda and Committee Elections. AAMAS 2017: 597-605.
  • Antoinette Baujard, Renaud Blanch, Sylvain Bouveret, Herrade Igersheim, Annick Laruelle, Jean-François Laslier, and Isabelle Lebon. Compte-rendu de l’expérimentation “Voter Autrement” lors du premier tour de l’élection présidentielle franc ̧aise le 23 avril 2017 `a Allevard-les-Bains, Crolles, Grenoble, Hérouville-Saint-Clair, Strasbourg et sur internet. 2017. 

  • Antoinette Baujard, Frédéric Gavrel, Herrade Igersheim, Jean-François Laslier and Isabelle Lebon: How voters use grade scales in evaluative voting. European Journal of Political Economy, Volume 55, December 2018, Pages 14-28.
  • Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe, and Abdallah Saffidine. Positional scoring-based allocation of indivisible goods. Autonomous Agents and Multi-Agent Systems, pages 1–28, 2016.
  • Khaled Belahcène, Yann Chevaleyre, Christophe Labreuche, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane: Accountable Approval Sorting, IJCAI-ECAI 2018.
  • Khaled Belahcene, Christophe Labreuche, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane. Comparing options with argument schemes powered by cancellation. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI-19), Aug 2019, Macao. 

  • Nawal Benabbou, Serena Di Sabatino Di Diodoro, Patrice Perny, and Paolo Viappiani. Incremental preference elicitation in multi-attribute domains for choice and ranking with the Borda count. In Scalable Uncertainty Management - 10th International Conference, SUM 2016, Nice, France, September 21-23, 2016, Proceedings, pages 81–95, 2016.
  • Nawal Benabbou and Patrice Perny. Solving multi-agent knapsack problems using incremental approval voting. In 22nd European Conference on Artificial Intelligence (ECAI’16), 2016. 

  • Nawal Benabbou and Patrice Perny. Adaptive elicitation of preferences under uncertainty in sequential decision making problems. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pages 4566–4572, 2017. 

  • Sebastian Bervoets and Vincent Merlin. On avoiding vote swapping. Social Choice and Welfare, 46(3):495–509, 2016. 

  • Sebastian Bervoets, Vincent Merlin, and Gerhard J. Woeginger. Vote trading and subset sums. Oper. Res. Lett., 43(1):99–102, 2015. 

  • Aurélie Beynier, Yann Chevaleyre, Laurent Gourvès, Julien Lesca, Nicolas Maudet, Anaëlle Wilczynski: Local Envy-Freeness in House Allocation Problems, AAMAS 2018
  • Aurélie Beynier, Sylvain Bouveret, Michel Lemaître, Nicolas Maudet, Simon Rey and Parham Shams (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.
  • Aurélie Beynier, Yann Chevaleyre, Laurent Gourvès, Ararat Harutyunyan, Julien Lesca, Nicolas Maudet, Anaëlle Wilczynski. Local Envy-Freeness in House Allocation Problems. In Journal of Autonomous Agents and Multiagent Systems, to appear.
  • Vittorio Bilò, Angelo Fanelli, Luca Moscardelli: On lookahead equilibria in congestion games. Mathematical Structures in Computer Science 27(2): 197-214 (2017)
  • Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli: The price of envy-freeness in machine scheduling. Theor. Comput. Sci. 613: 65-78 (2016)
  • Vittorio Bilò, Angelo Fanelli, Luca Moscardelli: Opinion Formation Games with Dynamic Social Influences. WINE 2016: 444-458.
  • Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli: Optimality and Nash Stability in Additively Separable Generalized Group Activity Selection Problems. IJCAI-19.
  • Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, and Luca Moscardelli: Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation. J. Artif. Intel. Res. 62: 315-371 (2018).
  • Vittorio Bilò, Laurent Gourvès, Jérôme Monnot: Project Games. CIAC 2019: 75-86
  • Nadjet Bourdache and Patrice Perny. Anytime algorithms for adaptive robust optimization with owa and wowa. In Proceedings of the 5th International Conference on Algorithmic Decision Theory (ADT-17), October 2017. 

  • Vittorio Bilò, Laurent Gourvès and Jérôme Monnot: On a Simple Hedonic Game with Graph-Restricted Communication. SAGT 2019: 252-265
  • Nadjet Bourdache and Patrice Perny: Active Preference Learning Based on Generalized Gini Functions: Application to the Multiagent Knapsack Problem. AAAI 2019: 7741-7748 .
  • Sylvain Bouveret, Katarina Cechlarova, Edith Elkind, Ayumi Igarashi, and Dominik Peters. Fair division of a graph. In Proceedings of the Twenty- Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, pages 135–141, 2017. 

  • Sylvain Bouveret, Yann Chevaleyre, François Durand, and Jérôme Lang. Voting by sequential elimination with few voters. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJ- CAI 2017, Melbourne, Australia, August 19-25, 2017, pages 128–134, 2017. 

  • Sylvain Bouveret and Michel Lemaître. Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Autonomous Agents and Multi-Agent Systems, 30(2):259–290, 2016. 

  • Sylvain Bouveret and Michel Lemaître. Efficiency and sequenceability in fair division of indivisible goods with additive preferences. In Sixth International Workshop on Computational Social Choice (COMSOC 2016), Toulouse, France, 2016. 

  • Sylvain Bouveret, Katarína Cechlárová and Julien Lesca (2019). Chore Division on a Graph. In Autonomous Agents and Multi-Agent Systems, 1--24.Springer US
  • Denis Bouyssou, Thierry Marchant, and Marc Pirlot. Axiomatic characterization of some disproportionality and malapportionment indices. Technical report, 2016.
  • Denis Bouyssou, Thierry Marchant,, 2016. "Ranking authors using fractional counting of citations: An axiomatic approach, Journal of Informetrics, Elsevier, vol. 10(1), pages 183-199.
  • Denis Bouyssou, Thierry Marchant: The β-ranking and the β-measure for directed networks: Axiomatic characterizations. Social Networks 52: 145-153, 2018 

  • Ioannis Caragiannis and Angelo Fanelli. An almost ideal coordination mechanism for unrelated machine scheduling. In Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Liverpool, UK, September 19-21, 2016. Proceedings, pages 315–326, 2016. 

  • René van den Brink and Agnieszka Rusinowska (2019). The degree ratio ranking method for directed networks, CES Working Papers, 2019.09.
  • Ioannis Caragiannis, Laurent Gourvès, and Jérôme Monnot. Achieving proportional representation in conference programs. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI’16), pages 144–150, 2016. 

  • Ioannis Caragiannis, Angelo Fanelli, Nick Gravin: Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. Algorithmica 77(4): 1143-1158 (2017).
  • Ioannis Caragiannis and Angelo Fanelli: On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies. ICALP-19.
  • Katarína Cechlárová, Laurent Gourvès and Julien Lesca: On the Problem of Assigning PhD Grants. IJCAI 2019: 130-136.
  • Giulia Cesari, Roberto Lucchetti and Stefano Moretti: Generalized additive games. Int J Game Theory (2017) 46: 919.
  • Frédéric Chantreuil, Sébastien Courtin, K. Fourrey and Isabelle Lebon. A note on the decomposability of inequality measures, Social Choice and Welfare, 53: 283-298, 2019.
  • Yann Chevaleyre, Ulle Endriss, and Nicolas Maudet. Distributed fair allocation of indivisible goods. Artificial Intelligence, 242:1–22, 2017. 

  • Johanne Cohen, and Fanny Pascual. Scheduling tasks from selfish multi-tasks agents. 21st International European Conference on Parallel and Distributed Computing (Euro-Par), LNCS 9233, pages 183-195, 2015.
  • Sébastien Courtin, Zéphirin Nganmeni, and Bertrand Tchantcho: The Shapley–Shubik power index for dichotomous multi-type games. Theory and Decision, 81(3):413–426, 2016. 

  • Sébastien Courtin, Zéphirin Nganmeni, and Bertrand Tchantcho: Dichotomous multi-type games with a coalition structure. Mathematical Social Sciences 86: 9-17 (2017)
  • Sébastien Courtin and Matias Nuñez. Dominance solvable approval voting games. Journal of Public Economic Theory. Forthcoming. 

  • Sébastien Courtin and Bernard Tchantcho: The public good indices for games with several levels of approval. A paraitre dans ""B.E. Journal of Theoreticals Economics'', 2019.
  • Anastasia Damamme, Aurélie Beynier, Yann Chevaleyre, and Nicolas Maudet. The power of swap deals in distributed resource allocation. In Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, May 4-8, 2015, pages 625–633, 2015. 

  • Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger: Group activity selection problem with approval preferences. Int. J. Game Theory 47(3): 767-796 (2018)
  • François Durand, Fabien Mathieu, and Ludovic Noirie. Can a Condorcet rule have a low coalitional manipulability. In ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, pages 707–715, 2016.
  • François Durand, Antonin Macé, and Matías Núñez. Analysis of Approval Voting in Poisson Games. In ''ACM conference on Economics and Computation (ACM EC '19)" June 24-28, 2019, Phoenix, AZ.
  • Edith Elkind, Angelo Fanelli, and Michele Flammini. Price of Pareto opti- mality in hedonic games. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA., pages 475–481, 2016. 

  • Ulle Endriss, Umberto Grandi, Ronald de Haan, and Jérôme Lang. Succinctness of languages for judgment aggregation. In Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016., pages 176–186, 2016. 

  • Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau: The Convergence of Iterative Delegations in Liquid Democracy in a Social Network. SAGT 2019: 284-297.
  • Bora Erdamar, Remzi Sanver, and Shin Sato. Evaluationwise strategy-proofness. Games and Economic Behavior, 106, 227-238.
  • Piotr Faliszewski, Laurent Gourvès, Jérôme Lang, Julien Lesca, and Jérôme Monnot. How hard is it for a party to nominate an election winner? In Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, pages 257–263, 2016. 

  • Piotr Faliszewski, Jean-François Laslier, Robert Schaefer, Piotr Skowron, Arkadii Slinko, and Nimrod Talmon. Modeling representation of minorities under multiwinner voting rules. CoRR, abs/1604.02364, 2016. 

  • Angelo Fanelli and Gianluigi Greco. Ride sharing with a vehicle of unlimited capacity. 41st International Symposium on Mathematical Foundations of Computer Science, 2016. 

  • János Flesch, Rida Laraki, Vianney Perchet: Approachability of convex sets in generalized quitting games, Games and Economic Behaviour, 2018.
  • Dimitris Fotakis, Laurent Gourvès, and Jérôme Monnot. Conference program design with single-peaked and single-crossing preferences. In International Conference on Web and Internet Economics, pages 221–235. Springer, 2016. 

  • Dimitris Fotakis, Laurent Gourvès and Jérôme Monnot: Selfish Transportation Games. SOFSEM 2017: 176-187
  • Lucie Galand and Thibaut Lust. Exact methods for computing all Lorenz optimal solutions to biobjective problems. In International Conference on Algorithmic Decision Theory, pages 305–321. Springer, 2015. 

  • Lucie Galand and Thibaut Lust. Multiagent fair optimization with Lorenz dominance. In Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, pages 1895–1896. International Foundation for Autonomous Agents and Multiagent Systems, 2015. 

  • Hugo Gilbert. Fair proportional representation problems with mixture operators. In ADT, 2017.
  • Hugo Gilbert, Nawal Benabbou, Patrice Perny, Olivier Spanjaard, and Paolo Viappiani. Incremental decision making under risk with the weighted expected utility model. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pages 4588–4594, 2017. 

  • Hugo Gilbert and Olivier Spanjaard. Optimizing a Generalized Gini Index in Stable Marriage Problems: NP-Hardness, Approximation and a Polynomial Time Special Case. Algorithmica, 81(7), 2653-2681, 2019.
  • Laurent Gourvès. Profitable deviation strong equilibria. In Algorithmic Decision Theory - 4th International Conference, ADT 2015, Lexington, KY, USA, September 27-30, Proceedings, pages 236–252, 2015. 

  • Laurent Gourvès, Julien Lesca, and Anaëlle Wilczynski. Strategic voting in a social context: Considerate equilibria. In ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, pages 1423–1431, 2016. 

  • Laurent Gourvès, Julien Lesca, and Anaëlle Wilczynski. Object allocation via swaps along a social network. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pages 213–219, 2017. 

  • Laurent Gourvès, Carlos A. Martinhon, and Jérôme Monnot. Object allocation problems under constraints. Proceedings of the Sixth International Workshop on Computational Social Choice (COMSOC’16), 2016.
  • Laurent Gourvès and Jérôme Monnot. Approximate maximin share allocations in matroids. In International Conference on Algorithms and Complexity, pages 310–321. Springer, 2017. 

  • Laurent Gourvès: Agreeable sets with matroidal constraints. J. Comb. Optim. 37(3): 866-888 (2019).
  • Laurent Gourvès, Jérôme Monnot: On maximin share allocations in matroids. Theor. Comput. Sci. 754: 50-64 (2019).
  • Michel Grabisch and Agnieszka Rusinowska. Determining influential mod- els. Operations Research and Decisions, 2016. 

  • Michel Grabisch and Agnieszka Rusinowska. Iterating influence in social networks. In Proceedings of SCIS-ISIS 2016 (Joint 8th International Conference on Soft Computing and Intelligent Systems and 17th International Symposium on Advanced Intelligent Systems), 2016. 

  • Gianluigi Greco and Jérôme Lang. Group decision making via weighted propositional logic: complexity and islands of tractability. In Proceedings of the 24th International Conference on Artificial Intelligence, pages 3008– 3014. AAAI Press, 2015. 

  • Adrian Haret, Hossein Khani, Stefano Moretti, Meltem Öztürk: Ceteris paribus majority for social ranking, IJCAI-ECAI 2018.
  • Adrian Haret, Arianna Novaro and Umberto Grandi. Preference Aggregation with Incomplete CP-nets. Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR), 2018.
  • Sean Horan, Martin Osborne and Remzi Sanver, 2019, Positively responsive collective choice rules and majority rule: A generalization of May’s theorem to many alternatives, International Economic Review, forthcoming.
  • Olivier Hudry. Complexity results for extensions of median orders to different types of remoteness. Annals of OR, 225(1):111–123, 2015. 

  • Olivier Hudry, Descent with mutations applied to the linear ordering problem, in Combinatorial Optimization, 5th International Symposium, ISCO 2018, Marrakech, Morocco, April 11–13, 2018, sous la direction de J. Lee, G. Rinaldi, A. R. Mahjoub, LNCS 10856, Springer, 2018, 253-264.
  • Olivier Hudry, Application of the “descent with mutations” metaheuristic to a clique partitioning problem, RAIRO 53 (3), 2019, 1083–1095.
  • Anisse Ismaili and Patrice Perny. Computational social choice for coordination in agent networks. Annals of Mathematics and Artificial Intelligence, 77:335–359, 2016. 

  • Eric Kamwa and Vincent Merlin. Scoring rules over subsets of alternatives: Consistency and paradoxes. Journal of Mathematical Economics, 61(1):130–138, 2015.
  • Eric Kamwa and Vincent Merlin. On the Likelihood of the Coincidence of Condorcet Committees, Economics Bulletin, AccessEcon, vol. 37(3), pages 2076-2085, 2017

  • Eric Kamwa and Vincent Merlin: Coincidence of Condorcet committees. Social Choice and Welfare 50(1): 171-189, 2018
  • Eric Kamwa and Vincent Merlin. The Likelihood of the Consistency of Collective Rankings Under Preferences Aggregation with Four Alternatives Using Scoring Rules: A General Formula and the Optimal Decision Rule. Comput. Econ. (2019) 53:1377.
  • Nikos Karanikolas, Renaud Blanch, and Sylvain Bouveret. Edge-compressed majority graph: Where social choice meets information visualization. In Proceedings of the Sixth International Workshop on Computational Social Choice (COMSOC’16), 2016. 

  • Hossein Khani, Stefano Moretti, Meltem Öztürk (2019) An Ordinal Banzhaf Index for Social Ranking. Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 378-384.
  • Justin Kruger, Stéphane Airiau: Refinements and Randomised Versions of Some Tournament Solutions. AAMAS 2017: 1584-1586
  • Justin Kruger, M. Remzi Sanver: Which dictatorial domains are superdictatorial? A complete characterization for the Gibbard-Satterthwaite impossibility, Mathematical Social Sciences, 2018.
  • Justin Kruger and Remzi Sanver: Restricting the domain allows for weaker independence, Social Choice and Welfare, 51(3), 563-575, 2018.
  • Jérôme Lang. Comment désigner le vainqueur d’une élection? Interstices, 2017. 

  • Jérôme Lang. Sur les effets indésirables du scrutin majoritaire à deux tours. Dauphine Recherches, 2, 2017. 

  • Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, and Lena Schend. Representing and solving hedonic games with ordinal preferences and thresholds. In Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, May 4-8, 2015, pages 1229–1237, 2015. 

  • Jérôme Lang, Jérôme Mengin and Lirong Xia: Voting on multi-issue domains with conditionally lexicographic preferences. Artif. Intell. 265: 18-44 (2018).
  • Jérôme Lang, Jérôme Monnot, Arkadii Slinko and William S. Zwicker: Beyond Electing and Ranking: Collective Dominating Chains, Dominating Subsets and Dichotomies. AAMAS 2017: 24-32
  • Jérôme Lang, Gabriella Pigozzi, Marija Slavkovik, Leon van der Torre and Srdjan Vesic: A partial taxonomy of judgment aggregation rules and their properties. Social Choice and Welfare 48(2): 327-356 (2017).
  • Jérôme Lang and Piotr Skowron. Multi-attribute proportional representation. In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI-16), pages 530–536. AAAI Press, 2016. 

  • Jérôme Lang, Marija Slavkovik and Srdjan Vesic: Agenda Separability in Judgment Aggregation. AAAI 2016: 1016-1022
  • Jérôme Lang and Piotr Skowron: Multi-attribute proportional representation. Artif. Intell. 263: 74-106 (2018)
  • Jean-François Laslier and Matias Nuñez. Pivots et elections. L’Actualité Economique, 2016. 

  • Jean-François Laslier, Matıas Nuñez, and Carlos Pimienta. Reaching consensus through approval bargaining. Games and Economic Behavior, 104:241–251, 2017. 

  • Jean-François Laslier and Tobias Rachidi. A multi-winner election: the 2016 social choice and welfare council election. Technical report, 2016.
  • Isabelle Lebon, Antoinette Baujard, Frédéric Gavrel, Herrade Igersheim and Jean-François Laslier, 2017. "Ce que le vote par approbation révèle des préférences des électeurs français," Revue économique, Presses de Sciences-Po, vol. 68(6), pages 1063-1076.

  • Sébastien Courtin, Jean-François Laslier and Isabelle Lebon: The 2017 French presidential election: Were voters happy with their first-round vote?. French politics. Vol 16(4), pp. 439-452, 2018.
  • Michel Le Breton, Dominique Lepelley, Antonin Macé and Vincent Merlin, Le mécanisme optimal de vote au sein du conseil des représentants d’un système fédéral, L’actualité économique, Vol 93, n°1-2, mars-Juin 2017, p 203-248.
  • Michel Le Breton, Dominique Lepelley, Vincent Merlin and Nicolas Sauger. Le scrutin binomial paritaire : un regard d’ingénierie électorale, Revue Economique, Vol 68, p 965-1004, 2017.
  • Julien Lesca, Patrice Perny, and Makoto Yokoo. Coalition structure generation and CS-core: Results on the tractability frontier for games represented by MC-nets. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, pages 308–316. International Foundation for Autonomous Agents and Multiagent Systems, 2017.
  • Julien Lesca and Taiki Todo: Service Exchange Problem, IJCAI-ECAI 2018
.
  • Hugo Martin and Patrice Perny: BiOWA for Preference Aggregation with Bipolar Scales: Application to Fair Optimization in Combinatorial Domains. IJCAI 2019: 1822-1828.
  • Vincent Merlin, Ipek Özkal Sanver and Remzi Sanver, Compromise Rules Revisited, Group Decision and Negociation (2019) 28: 63.
  • Stefano Moretti and Meltem Öztürk. Ordinal power relations and social rankings. In Sixth International Workshop on Computational Social Choice (COMSOC 2016), Toulouse, France, 2016. 

  • Stefano Moretti, Meltem Öztürk, and Alexis Tsoukias. Preference Modelling, pages 43 – 95. Springer Verlag, 2016. 

  • Stefano Moretti (2018), On Cooperative Connection Situations Where the Players Are Located at the Edges. In: Belardinelli F., Argente E. (eds) Multi-Agent Systems and Agreement Technologies. EUMAS 2017, AT 2017. Lecture Notes in Computer Science, vol 10767. Springer.
  • Matias Nuñez. Threshold voting leads to type-revelation. Economics Letters, 136:211–213, 2015. 

  • Matias Nuñez and Remzi Sanver. Revisiting the connection between the no- show paradox and monotonicity. Mathematical Social Sciences. To appear.
  • Matias Nuñez and Dimitrios Xefteris. Implementation via approval mechanisms. J. Economic Theory, 170:169–181, 2017. 

  • Soufiane Drissi Oudghiri, Patrice Perny, Olivier Spanjaard, and Mohamed Hachimi. Using the Sugeno integral in optimal assignment problems with qualitative utilities. In European Conference on Artificial Intelligence, 2016.
  • Ahmet Ozkardas and Agnieszka Rusinowska. Inefficient equilibria in wage bargaining with discount rates varying in time. Economics Bulletin, 35(3):1744–1751, 2015. 

  • Ahmet Ozkardas and Agnieszka Rusinowska. Holdout threats during wage bargaining. Trans. Computational Collective Intelligence, 23:111–127, 2016.
  • Fanny Pascual, Krzysztof Rzadca, Piotr Skowron: Collective Schedules: Scheduling Meets Computational Social Choice. AAMAS 2018.
  • Remzi Sanver, Implementing Pareto optimal and individually rational outcomes by veto, Group Decision and Negotiation 27(2), 223-233.
  • Piotr Skowron, Piotr Faliszewski, and Jérôme Lang. Finding a collective set of items: from proportional multirepresentation to group recommendation. In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI-15), pages 2131–2137. AAAI Press, 2015.
  • Piotr Skowron, Piotr Faliszewski and Jérôme Lang : Finding a collective set of items: From proportional multirepresentation to group recommendation. Artif. Intell. 241: 191-216 (2016)
  • Stefano Teso, Andrea Passerini and Paolo Viappiani: Constructive Preference Elicitation for Multiple Users with Setwise Max-margin. ADT 2017: 3-17
  • Paolo Viappiani. Characterization of scoring rules with distances: Application to the clustering of rankings. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 104–110, 2015. 

  • Paolo Viappiani: Positional Scoring Rules with Uncertain Weights. SUM 2018: 306-320