相关论文: Committee Scoring Rules: Axiomatic Characterizatio…

Approval-like voting rules, such as Sincere-Strategy Preference-Based Approval voting (SP-AV), the Bucklin rule (an adaptive variant of $k$-Approval voting), and the Fallback rule (an adaptive variant of SP-AV) have many desirable…

We propose a simple method for combining together voting rules that performs a run-off between the different winners of each voting rule. We prove that this combinator has several good properties. For instance, even if just one of the base…

Scoring systems are an extremely important class of election systems. We study the complexity of manipulation, constructive control by deleting voters (CCDV), and bribery for scoring systems. For manipulation, we show that for all scoring…

When selecting committees based on preferences of voters, a variety of different criteria can be considered. Two natural objectives are maximizing the utilitarian welfare (the sum of voters' utilities) and coverage (the number of…

In recent years, probabilistic forecasting is an emerging topic, which is why there is a growing need of suitable methods for the evaluation of multivariate predictions. We analyze the sensitivity of the most common scoring rules,…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

We extend the criterion of Kawatani and Okawa for indecomposability of the derived category of a smooth projective variety to arbitrary schemes. For relative schemes, we also give a criterion for the nonexistence of semiorthogonal…

The main idea of the {\em distance rationalizability} approach to view the voters' preferences as an imperfect approximation to some kind of consensus is deeply rooted in social choice literature. It allows one to define ("rationalize")…

We consider distributed elections, where there is a center and $k$ sites. In such distributed elections, each voter has preferences over some set of candidates, and each voter is assigned to exactly one site such that each site is aware…

Algorithmic decision making has proliferated and now impacts our daily lives in both mundane and consequential ways. Machine learning practitioners make use of a myriad of algorithms for predictive models in applications as diverse as movie…

Election rules are formal processes that aggregate voters preferences, typically to select a single candidate, called the winner. Most of the election rules studied in the literature require the voters to rank the candidates from the most…

Scoring rules are an important tool for evaluating the performance of probabilistic forecasting schemes. In the binary case, scoring rules (which are strictly proper) allow for a decomposition into terms related to the resolution and to the…

We investigate joint probabilistic choice rules describing the behavior of two decision makers, each facing potentially distinct menus. These rules are separable when they can be decomposed into individual choices correlated solely through…

We introduce a broad class of analytically solvable processes on networks. In the special case, they reduce to random walk and consensus process - two most basic processes on networks. Our class differs from previous models of interactions…

A social decision rule (SDR) is any non-empty set-valued map that associates any profile of individual preferences with the set of (winning) alternatives. An SDR is Condorcet-consistent if it selects the set of Condorcet winners whenever…

In an approval-based committee election, the task is to select a committee of up to $k$ candidates from a set of $m$ candidates based on the preferences of $n$ voters, each of whom approves a subset of the candidates. A central open…

In acoustic scene classification researches, audio segment is usually split into multiple samples. Majority voting is then utilized to ensemble the results of the samples. In this paper, we propose a punishment voting algorithm based on the…

Even though proportional representation is a fundamental goal in multiwinner voting and a plethora of proportionality notions has been introduced, the normative justifications for choosing one notion over another remain poorly understood.…

Multi-winner approval-based voting has received considerable attention recently. A voting rule in this setting takes as input ballots in which each agent approves a subset of the available alternatives and outputs a committee of…

A sum rule is an identity connecting the entropy of a measure with coefficients involved in the construction of its orthogonal polynomials (Jacobi coefficients). Our paper is an extension of Gamboa, Nagel and Rouault (2016), where we have…