scholarly journals A Structural Approach to Activity Selection

Author(s):  
Eduard Eiben ◽  
Robert Ganian ◽  
Sebastian Ordyniak

The general task of finding an assignment of agents to activities under certain stability and rationality constraints has led to the introduction of two prominent problems in the area of computational social choice: Group Activity Selection (GASP) and Stable Invitations (SIP). Here we introduce and study the Comprehensive Activity Selection Problem, which naturally generalizes both of these problems. In particular, we apply the parameterized complexity paradigm, which has already been successfully employed for SIP and GASP. While previous work has focused strongly on parameters such as solution size or number of activities, here we focus on parameters which capture the complexity of agent-to-agent interactions. Our results include a comprehensive complexity map for CAS under various restrictions on the number of activities in combination with restrictions on the complexity of agent interactions.

Author(s):  
Andreas Darmann ◽  
Edith Elkind ◽  
Sascha Kurz ◽  
Jérôme Lang ◽  
Joachim Schauer ◽  
...  

Author(s):  
Benny Kimelfeld ◽  
Phokion G. Kolaitis ◽  
Julia Stoyanovich

We develop a novel framework that aims to create bridges between the computational social choice and the database management communities. This framework enriches the tasks currently supported in computational social choice with relational database context, thus making it possible to formulate sophisticated queries about voting rules, candidates, voters, issues, and positions. At the conceptual level, we give rigorous semantics to queries in this framework by introducing the notions of necessary answers and possible answers to queries. At the technical level, we embark on an investigation of the computational complexity of the necessary answers. In particular, we establish a number of results about the complexity of the necessary answers of conjunctive queries involving the plurality rule that contrast sharply with earlier results about the complexity of the necessary winners under the plurality rule.


2017 ◽  
Vol 47 (3) ◽  
pp. 767-796 ◽  
Author(s):  
Andreas Darmann ◽  
Edith Elkind ◽  
Sascha Kurz ◽  
Jérôme Lang ◽  
Joachim Schauer ◽  
...  

Author(s):  
Nikos Karanikolas ◽  
Pierre Bisquert ◽  
Patrice Buche ◽  
Christos Kaklamanis ◽  
Rallou Thomopoulos

In the current article, the authors describe an applied procedure to support collective decision making for applications in agriculture. An extended 2-page abstract of this paper has been accepted by the EFITA WCCA congress and this manuscript is an extended version of this submission. The problem the authors are facing in this paper is how to reach the best decision regarding issues coming from agricultural engineering with the aid of Computational Social Choice (CSC) and Argumentation Framework (AF). In the literature of decision-making, several approaches from the domains of CSC and AF have been used autonomously to support decisions. It is our belief that with the combination of these two fields the authors can propose socially fair decisions which take into account both (1) the involved agents' preferences and (2) the justifications behind these preferences. Therefore, this article implements a software tool for decision-making which is composed of two main systems, i.e., the social choice system and the deliberation system. In this article, the authors describe thoroughly the social choice system of our tool and how it can be applied to different alternatives on the valorization of materials coming from agriculture. As an example, that is demonstrated an application of our tool in the context of Ecobiocap European project where several decision problems are to be addressed. These decision problems consist in finding the best solutions for questions regarding food packaging and end-of-life management.


Sign in / Sign up

Export Citation Format

Share Document