Search Results for author:
Found 7 papers, 0 papers with code
Computing and Testing Pareto Optimal Committees
Selecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond.
Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation
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.
Multi-Attribute Proportional Representation
We consider the following problem in which a given number of items has to be chosen from a predefined set.
The Computational Complexity of Dominance and Consistency in CP-Nets
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
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
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.
Collective discrete optimisation as judgment aggregation
Many important collective decision-making problems can be seen as multi-agent versions of discrete optimisation problems.
