4,130 research outputs found

    Antipodality in committee selection

    Get PDF
    In this paper we compare a minisum and a minimax procedure as suggested by Brams et al. for selecting committees from a set of candidates. Using a general geometric framework as developed by Don Saari for preference aggregation, we show that antipodality of a unique maximin and a unique minisum winner can occur for any number of candidates larger than two.

    A Framework for Approval-based Budgeting Methods

    Full text link
    We define and study a general framework for approval-based budgeting methods and compare certain methods within this framework by their axiomatic and computational properties. Furthermore, we visualize their behavior on certain Euclidean distributions and analyze them experimentally

    Preference fusion and Condorcet's Paradox under uncertainty

    Get PDF
    Facing an unknown situation, a person may not be able to firmly elicit his/her preferences over different alternatives, so he/she tends to express uncertain preferences. Given a community of different persons expressing their preferences over certain alternatives under uncertainty, to get a collective representative opinion of the whole community, a preference fusion process is required. The aim of this work is to propose a preference fusion method that copes with uncertainty and escape from the Condorcet paradox. To model preferences under uncertainty, we propose to develop a model of preferences based on belief function theory that accurately describes and captures the uncertainty associated with individual or collective preferences. This work improves and extends the previous results. This work improves and extends the contribution presented in a previous work. The benefits of our contribution are twofold. On the one hand, we propose a qualitative and expressive preference modeling strategy based on belief-function theory which scales better with the number of sources. On the other hand, we propose an incremental distance-based algorithm (using Jousselme distance) for the construction of the collective preference order to avoid the Condorcet Paradox.Comment: International Conference on Information Fusion, Jul 2017, Xi'an, Chin

    Social Choice, Optimal Inference and Figure Skating

    Get PDF
    We approach the social choice problem as one of optimal statistical inference. If individual voters or judges observe the true order ona set of alternatives with error, then it is possible to use the set of individual rankings to make probability statements about the correct social order. Given the posterior distribution for orders and a suitably chosen loss function, an optimal order is one that minimises expected posterior loss. The paper develops a statistical model describing the behaviour of judges, and discusses Markov Chain Monte Carlo estimation. We also discuss criteria for choosing the appropriate loss functions. We apply our methods to a well-known problem: determining the correct ranking for figure skaters competing at the Olympic Games.Vote aggregation, ranking rules, figure skating, Bayesian methods, optimal inference, Markov Chain Monte Carlo

    Fiscal decentralization : a political economy perspective

    Get PDF
    This paper surveys recent contributions to the study of fiscal decentralization which adopt a political economy approach. It is argued that this approach can capture, in a variety of formal models, the plausible and influential ideas (increasingly, supported by empirical evidence) that fiscal decentralization can lead to improved preference-matching and accountability of government. In particular, recent work on centralized provision of public good provision via bargaining in a legislature shows how centralization reduces preference-matching, and recent work using "electoral agency" models formalizes the accountability argument. These models also provide insights into when decentralization may fail to deliver these benefits

    Approval-Based Shortlisting

    Full text link
    Shortlisting is the task of reducing a long list of alternatives to a (smaller) set of best or most suitable alternatives from which a final winner will be chosen. Shortlisting is often used in the nomination process of awards or in recommender systems to display featured objects. In this paper, we analyze shortlisting methods that are based on approval data, a common type of preferences. Furthermore, we assume that the size of the shortlist, i.e., the number of best or most suitable alternatives, is not fixed but determined by the shortlisting method. We axiomatically analyze established and new shortlisting methods and complement this analysis with an experimental evaluation based on biased voters and noisy quality estimates. Our results lead to recommendations which shortlisting methods to use, depending on the desired properties
    • 

    corecore