Aggregating Dependency Graphs into Voting Agendas in Multi-Issue Elections

Many collective decision making problems have a combinatorial structure: the agents involved must decide on multiple issues and their preferences over one issue may depend on the choices adopted for some of the others. Voting is an attractive method for making collective decisions, but conducting a multi-issue election is challenging. On the one hand, requiring agents to vote by expressing their preferences over all combinations of issues is computationally infeasible; on the other, decomposing the problem into several elections on smaller sets of issues can lead to paradoxical outcomes. Any pragmatic method for running a multi-issue election will have to balance these two concerns. We identify and analyse the problem of generating an agenda for a given election, specifying which issues to vote on together in local elections and in which order to schedule those local elections

Resolving Multi-party Privacy Conflicts in Social Media

Items shared through Social Media may affect more than one user's privacy --- e.g., photos that depict multiple users, comments that mention multiple users, events in which multiple users are invited, etc. The lack of multi-party privacy management support in current mainstream Social Media infrastructures makes users unable to appropriately control to whom these items are actually shared or not. Computational mechanisms that are able to merge the privacy preferences of multiple users into a single policy for an item can help solve this problem. However, merging multiple users' privacy preferences is not an easy task, because privacy preferences may conflict, so methods to resolve conflicts are needed. Moreover, these methods need to consider how users' would actually reach an agreement about a solution to the conflict in order to propose solutions that can be acceptable by all of the users affected by the item to be shared. Current approaches are either too demanding or only consider fixed ways of aggregating privacy preferences. In this paper, we propose the first computational mechanism to resolve conflicts for multi-party privacy management in Social Media that is able to adapt to different situations by modelling the concessions that users make to reach a solution to the conflicts. We also present results of a user study in which our proposed mechanism outperformed other existing approaches in terms of how many times each approach matched users' behaviour.Comment: Authors' version of the paper accepted for publication at IEEE Transactions on Knowledge and Data Engineering, IEEE Transactions on Knowledge and Data Engineering, 201

Active Collaborative Ensemble Tracking

A discriminative ensemble tracker employs multiple classifiers, each of which casts a vote on all of the obtained samples. The votes are then aggregated in an attempt to localize the target object. Such method relies on collective competence and the diversity of the ensemble to approach the target/non-target classification task from different views. However, by updating all of the ensemble using a shared set of samples and their final labels, such diversity is lost or reduced to the diversity provided by the underlying features or internal classifiers' dynamics. Additionally, the classifiers do not exchange information with each other while striving to serve the collective goal, i.e., better classification. In this study, we propose an active collaborative information exchange scheme for ensemble tracking. This, not only orchestrates different classifier towards a common goal but also provides an intelligent update mechanism to keep the diversity of classifiers and to mitigate the shortcomings of one with the others. The data exchange is optimized with regard to an ensemble uncertainty utility function, and the ensemble is updated via co-training. The evaluations demonstrate promising results realized by the proposed algorithm for the real-world online tracking.Comment: AVSS 2017 Submissio

Network Analysis, Creative System Modelling and Decision Support: The NetSyMoD Approach

This paper presents the NetSyMoD approach – where NetSyMod stands for Network Analysis – Creative System Modelling – Decision Support. It represents the outcome of several years of research at FEEM in the field of natural resources management, environmental evaluation and decision-making, within the Natural Resources Management Research Programme. NetSyMoD is a flexible and comprehensive methodological framework, which uses a suite of support tools, aimed at facilitating the involvement of stakeholders or experts in decision-making processes. The main phases envisaged for the process are: (i) the identification of relevant actors, (ii) the analysis of social networks, (iii) the creative system modelling and modelling of the reality being considered (i.e. the local socio-economic and environmental system), and (iv) the analysis of alternative options available for the management of the specific case (e.g. alternative projects, plans, strategies). The strategies for participation are necessarily context-dependent, and thus not all the NetSyMod phases may be needed in every application. Furthermore, the practical solutions for their implementation may significantly differ from one case to another, depending not only on the context, but also on the available resources (human and financial). The various applications of NetSyMoD have nonetheless in common the same approach for problem analysis and communication within a group of actors, based upon the use of creative thinking techniques, the formalisation of human-environment relationships through the DPSIR framework, and the use of multi-criteria analysis through the mDSS software.Social Network, Integrated Analysis, Participatory Modelling, Decision Support

An Incentive Compatible Multi-Armed-Bandit Crowdsourcing Mechanism with Quality Assurance

Consider a requester who wishes to crowdsource a series of identical binary labeling tasks to a pool of workers so as to achieve an assured accuracy for each task, in a cost optimal way. The workers are heterogeneous with unknown but fixed qualities and their costs are private. The problem is to select for each task an optimal subset of workers so that the outcome obtained from the selected workers guarantees a target accuracy level. The problem is a challenging one even in a non strategic setting since the accuracy of aggregated label depends on unknown qualities. We develop a novel multi-armed bandit (MAB) mechanism for solving this problem. First, we propose a framework, Assured Accuracy Bandit (AAB), which leads to an MAB algorithm, Constrained Confidence Bound for a Non Strategic setting (CCB-NS). We derive an upper bound on the number of time steps the algorithm chooses a sub-optimal set that depends on the target accuracy level and true qualities. A more challenging situation arises when the requester not only has to learn the qualities of the workers but also elicit their true costs. We modify the CCB-NS algorithm to obtain an adaptive exploration separated algorithm which we call { \em Constrained Confidence Bound for a Strategic setting (CCB-S)}. CCB-S algorithm produces an ex-post monotone allocation rule and thus can be transformed into an ex-post incentive compatible and ex-post individually rational mechanism that learns the qualities of the workers and guarantees a given target accuracy level in a cost optimal way. We provide a lower bound on the number of times any algorithm should select a sub-optimal set and we see that the lower bound matches our upper bound upto a constant factor. We provide insights on the practical implementation of this framework through an illustrative example and we show the efficacy of our algorithms through simulations

How to Think Critically about the Common Past? On the Feeling of Communism Nostalgia in Post-Revolutionary Romania

This article proposes a phenomenological interpretation of nostalgia for communism, a collective feeling expressed typically in most Eastern European countries after the official fall of the communist regimes. While nostalgia for communism may seem like a paradoxical feeling, a sort of Stockholm syndrome at a collective level, this article proposes a different angle of interpretation: nostalgia for communism has nothing to do with communism as such, it is not essentially a political statement, nor the signal of a deep value tension between governance and the people. Rather, I propose to understand this collective feeling as the symptom of a deeper need at a national level for solidarity and ultimately about recapturing a common feeling of identity in solidarity. This hypothesis would be in line with a phenomenological approach to memory as a process of establishing shared codes by rewriting the past in such a way as to strengthen social bonds and make possible a reimagining of a common future. Nostalgia for communism does not need to be ultimately an uncritical stance as it has been depicted, instead one could interpret it as a form of critical reflexion about our current forms of life. Instead of seeing communism nostalgia as a specific form of being stuck in the past, one could explore its potential for pointing at the things that are still not working in the current neo-liberal regime

Creative Thinking and Modelling for the Decision Support in Water Management

This paper reviews the state of art in knowledge and preferences elicitation techniques. The purpose of the study was to evaluate various cognitive mapping techniques in order to conclude with the identification of the optimal technique for the NetSyMod methodology. Network Analysis – Creative System Modelling (NetSyMod) methodology has been designed for the improvement of decision support systems (DSS) with respect to the environmental problems. In the paper the difference is made between experts and stakeholders knowledge and preference elicitation methods. The suggested technique is very similar to the Nominal Group Techniques (NGT) with the external representation of the analysed problem by means of the Hodgson Hexagons. The evolving methodology is undergoing tests within several EU-funded projects such as: ITAES, IISIM, NostrumDSS.Creative modelling, Cognitive mapping, Preference elicitation techniques, Decision support

Simultaneous Elicitation of Committee and Voters' Preferences

Co-localisées avec la Plate-Forme Intelligence Artificielle (PFIA 2019)International audienceSocial choice deals with the problem of determining a consensus choice from the preferences of different voters. In the classical setting, the voting rule is fixed beforehand and full information concerning he preferences of the voters is provided. Recently, the assumption of full preference information has been questioned by a number of researchers and several methods for eliciting preferences have been proposed. In this paper we go one step further and we assume that both the voting rule and the voters’ preferences are partially specified. In this setting, we present an interactive elicitation protocol based on minimax regret and develop several query strategies that interleave questions to the chair and questions to the voters in order to attempt to acquire the most relevant information in order to quickly converge to optimal or a near-optimal alternative

Participation in voting over budget allocations. A field experiment

We study the effect on the participation rate of employing different voting rules in the context of the problem to allocate a fixed monetary budget to two different public projects. Specifically, we compare the mean rule according to which the average of the individually proposed allocations is implemented with the median rule which chooses the allocation proposed by the median voter as the social outcome. We report the results of a field experiment in which subjects (students of KIT) could allocate money to fund two different public projects, the student’s bike shop and a campus garden project. The treatment variable was the collective decision rule employed. While the mean and median rules have very different properties in theory, we found no significant treatment effect on the participation rate. Our results nevertheless shed important light on the use of different voting rules in the context of budget allocation in practice