Search Results for author: Jerome Lang

Found 7 papers, 0 papers with code

Collective discrete optimisation as judgment aggregation

no code implementations1 Dec 2021 Linus Boes, Rachael Colley, Umberto Grandi, Jerome Lang, Arianna Novaro

Many important collective decision-making problems can be seen as multi-agent versions of discrete optimisation problems.

Decision Making Scheduling

Computing and Testing Pareto Optimal Committees

no code implementations18 Mar 2018 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.

Multi-Attribute Proportional Representation

no code implementations11 Sep 2015 Jerome Lang, Piotr Skowron

We consider the following problem in which a given number of items has to be chosen from a predefined set.

Attribute

Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation

no code implementations13 Feb 2014 Piotr Skowron, Piotr Faliszewski, Jerome Lang

We consider the following problem: There is a set of items (e. g., movies) and a group of agents (e. g., passengers on a plane); each agent has some intrinsic utility for each of the items.

The Computational Complexity of Dominance and Consistency in CP-Nets

no code implementations15 Jan 2014 Judy Goldsmith, Jerome Lang, Miroslaw Truszczyski, Nic Wilson

In our main results, we show here that both dominance and consistency for general CP-nets are PSPACE-complete.

Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence

no code implementations23 Oct 2013 Jerome Lang, Bruno Zanuttini

Knowledge-based programs (KBPs) are high-level protocols describing the course of action an agent should perform as a function of its knowledge.

Automated Reasoning Using Possibilistic Logic: Semantics, Belief Revision and Variable Certainty Weights

no code implementations27 Mar 2013 Didier Dubois, Jerome Lang, Henri Prade

In case where only lower bounds of necessity measures are involved, a semantics is proposed, in which the completeness of the extended resolution principle is proved.

Cannot find the paper you are looking for? You can Submit a new open access paper.