activity
20032024
most citedThe Computational Complexity of Dominance and Consistency in CP-Nets

141 citations · 180 across the 25 of their papers we have counts for

collaborators
Showing cs.GTShow all

12 papers · 1 filter

cs.GT2021

Truth-tracking via Approval Voting: Size Matters

Tahar Allouche, Jérôme Lang, Florian Yger

Epistemic social choice aims at unveiling a hidden ground truth given votes, which are interpreted as noisy signals about it. We consider here a simple setting where votes consist…

cs.GT2020

Approximating Voting Rules from Truncated Ballots

Manel Ayadi, Nahla Ben amor, Jérôme Lang

Classical voting rules assume that ballots are complete preference orders over candidates. However, when the number of candidates is large enough, it is too costly to ask the voter…

cs.GT2018

Computing and Testing Pareto Optimal Committees

Haris Aziz, Jerome Lang, Jerome Monnot

Selecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond. Among the various criteria put forth for the desirabil…

cs.GT2017★ 1 cited

Proceedings Sixteenth Conference on Theoretical Aspects of Rationality and Knowledge

Jérôme Lang

This volume consists of papers presented at the Sixteenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK) held at the University of Liverpool, UK, from July 2…

cs.GT2016

Efficient Reallocation under Additive and Responsive Preferences

Haris Aziz, Peter Biro, Jerome Lang +2

Reallocating resources to get mutually beneficial outcomes is a fundamental problem in various multi-agent settings. While finding an arbitrary Pareto optimal allocation is general…

cs.GT2016

Complexity of Manipulating Sequential Allocation

Haris Aziz, Sylvain Bouveret, Jerome Lang +1

Sequential allocation is a simple allocation mechanism in which agents are given pre-specified turns and each agents gets the most preferred item that is still available. It has lo…