Increasing environmental sustainability by incorporating stakeholders' intensities of preferences into the policy formation

In this paper a tractable methodology is presented to improve environmental sustainability by incorporating stakeholders’ intensities of preferences into the decision making process. The environmental decision making will be controversial when there is a complex issue at hand. The difficulty comes up as stakeholders cannot see how their preferences are taken into account in the policy making process. To reduce this controversy, we propose a qualitative method to elicit stakeholders’ intensities of preferences towards a set of environmental services. Subsequently, the elicited intensities of preferences are aggregated by a mathematical approach on each single criterion. Finally, a multi-criteria approach is applied to use the aggregated values across all criteria to provide the analyst with a rank order of existing alternative plans. In this way, the stakeholders are able to verify that their opinion is taken into account, even if it is contrary to the majority voice. The natural resources manager will benefit from an increased insight into the prevalent opinion on each of the criteria through the supplied social intensities of preferences, enabling a more easily communicated justification of the final decision, and an augmented tractability of the decision making process.Sustainability, stakeholder's preferences, tractable decision making, social support, qualitative valuation, Environmental Economics and Policy,

Construction of time preference: an investigation of the role of elicitation method in experimental elicitation of time preference.

The idea of preference reversal and construction of preference is not new to literature in decision making. Indeed, several theories have been developed to explain it. (Lichtenstein and Slovic, 2006). The present paper considers heuristics activated in different elicitation procedures applied in time preference research. I show that activation of these rules in correspondence with different elicitation methods leads to observation of a particular pattern most frequently reported in time preference literature: hyperbolic discounting. In particular, I analyze two most diffused elicitation procedures, matching task and two variations of choice task in multiple price list format (MPL). In a series of experiments I demonstrate that matching task is characterized by choice of focal amounts and anchoring to previously reported amount. At the same time, choice in MPL format largely depends on the structure of the list from which the choice is made. I study two widely used structures of MPL choice task format: (a) MPL with nominal structure (Green et al, 1997), where choice alternatives correspond to the same nominal amounts that are available at different time horizons; (b) MPL with interest rate structure (Coller and Williams, 1999), in which monetary alternatives at each time horizon in consideration are constructed as increases corresponding to a fixed interest rate. Although these two elicitation structures activate similar decision processes they lead to observation of qualitatively different results that are in large part defined by the underlying structure of the list of alternatives. I show that matching task and MPL with nominal structure lead to observation of hyperbolic evidence, that could be of different kinds depending on the structure of MPL table. At the same time, elicitation with MPL with interest rate structure leads to observation of rather stable time preference that can be well approximated by exponential discounting.decision making; time preference; elicitation procedures

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

Automated Negotiations Under Uncertain Preferences

Automated Negotiation is an emerging field of electronic markets and multi-agent system research. Market engineers are faced in this connection with computational as well as economic issues, such as individual rationality and incentive compatibility. Most literature is focused on autonomous agents and negotiation protocols regarding these issues. However, common protocols show two deficiencies: (1) neglected consideration of agents’ incentives to strive for social welfare, (2) underemphasised acknowledgement that agents build their decision upon preference information delivered by human principals. Since human beings make use of heuristics for preference elicitation, their preferences are subject to informational uncertainty. The contribution of this paper is the proposition of a research agenda that aims at overcoming these research deficiencies. Our research agenda draws theoretically and methodologically on auctions, iterative bargaining, and fuzzy set theory. We complement our agenda with simulation-based preliminary results regarding differences in the application of auctions and iterative bargaining

Construction of time preference: an investigation of the role of elicitation method in experimental elicitation of time preference.

The idea of preference reversal and construction of preference is not new to literature in decision making. Indeed, several theories have been developed to explain it. (Lichtenstein and Slovic, 2006). The present paper considers heuristics activated in different elicitation procedures applied in time preference research. I show that activation of these rules in correspondence with different elicitation methods leads to observation of a particular pattern most frequently reported in time preference literature: hyperbolic discounting. In particular, I analyze two most diffused elicitation procedures, matching task and two variations of choice task in multiple price list format (MPL). In a series of experiments I demonstrate that matching task is characterized by choice of focal amounts and anchoring to previously reported amount. At the same time, choice in MPL format largely depends on the structure of the list from which the choice is made. I study two widely used structures of MPL choice task format: (a) MPL with nominal structure (Green et al, 1997), where choice alternatives correspond to the same nominal amounts that are available at different time horizons; (b) MPL with interest rate structure (Coller and Williams, 1999), in which monetary alternatives at each time horizon in consideration are constructed as increases corresponding to a fixed interest rate. Although these two elicitation structures activate similar decision processes they lead to observation of qualitatively different results that are in large part defined by the underlying structure of the list of alternatives. I show that matching task and MPL with nominal structure lead to observation of hyperbolic evidence, that could be of different kinds depending on the structure of MPL table. At the same time, elicitation with MPL with interest rate structure leads to observation of rather stable time preference that can be well approximated by exponential discounting.

Resolving the Complexity of Some Fundamental Problems in Computational Social Choice

This thesis is in the area called computational social choice which is an intersection area of algorithms and social choice theory.Comment: Ph.D. Thesi

Computational Aspects of Multi-Winner Approval Voting

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show that computing the winner for proportional approval voting is NP-hard, closing a long standing open problem. As none of the rules are strategyproof, even for dichotomous preferences, we study various strategic aspects of the rules. In particular, we examine the computational complexity of computing a best response for both a single agent and a group of agents. In many settings, we show that it is NP-hard for an agent or agents to compute how best to vote given a fixed set of approval ballots from the other agents

Computational aspects of voting: a literature survey

Preference aggregation is a topic of study in different fields such as philosophy, mathematics, economics and political science. Recently, computational aspects of preference aggregation have gained especial attention and “computational politics” has emerged as a marked line of research in computer science with a clear concentration on voting protocols. The field of voting systems, rooted in social choice theory, has expanded notably in both depth and breadth in the last few decades. A significant amount of this growth comes from studies concerning the computational aspects of voting systems. This thesis comprehensively reviews the work on voting systems (from a computing perspective) by listing, classifying and comparing the results obtained by different researchers in the field. This survey covers a wide range of new and historical results yet provides a profound commentary on related work as individual studies and in relation to other related work and to the field in general. The deliverables serve as an overview where students and novice researchers in the field can start and also as a depository that can be referred to when searching for specific results. A comprehensive literature survey of the computational aspects of voting is a task that has not been undertaken yet and is initially realized here. Part of this research was dedicated to creating a web-depository that contains material and references related to the topic based on the survey. The purpose was to create a dynamic version of the survey that can be updated with latest findings and as an online practical reference