English
Related papers

Related papers: Phragm\'en's sequential method with a variance cri…

200 papers

We study a model of voting with two alternatives in a symmetric environment. We characterize the interim allocation probabilities that can be implemented by a symmetric voting rule. We show that every such interim allocation probabilities…

Theoretical Economics · Economics 2023-04-04 Xu Lang , Debasis Mishra

Approval-based committee (ABC) voting rules elect a fixed size subset of the candidates, a so-called committee, based on the voters' approval ballots over the candidates. While these rules have recently attracted significant attention,…

Computer Science and Game Theory · Computer Science 2023-02-24 Chris Dong , Patrick Lederer

Recently, we have proposed a new diffusive representation for fractional derivatives and, based on this representation, suggested an algorithm for their numerical computation. From the construction of the algorithm, it is immediately…

Numerical Analysis · Mathematics 2022-04-12 Kai Diethelm

The division of mandates to the European Parliament posed difficulties since the beginning of its operation. Introduction of the degressive proportionality principle to legal acts intensified further discussion on this subject. The…

Physics and Society · Physics 2013-01-03 Katarzyna Cegielka

The shrinking rank method is a variation of slice sampling that is efficient at sampling from multivariate distributions with highly correlated parameters. It requires that the gradient of the log-density be computable. At each individual…

Computation · Statistics 2010-11-23 Madeleine B. Thompson , Radford M. Neal

We consider the bifurcation problem u'' + \lambda u = N(u) with two point boundary conditions where N(u) is a general nonlinear term which may also depend on the eigenvalue \lambda. A new derivation of a variational principle for the lowest…

patt-sol · Physics 2009-10-30 R. D. Benguria , M. C. Depassier

The basic idea of voting protocols is that nodes query a sample of other nodes and adjust their own opinion throughout several rounds based on the proportion of the sampled opinions. In the classic model, it is assumed that all nodes have…

Probability · Mathematics 2021-01-28 Abraham Gutierrez , Sebastian Müller , Stjepan Šebek

In this paper, I propose a method for correcting sample selection bias when the outcome of interest is categorical, such as occupational choice, health status, or field of study. Classical approaches to sample selection rely on strong…

Econometrics · Economics 2025-11-11 Onil Boussim

This paper presents a method for analysis of the vote space created from the local features extraction process in a multi-detection system. The method is opposed to the classic clustering approach and gives a high level of control over the…

Computer Vision and Pattern Recognition · Computer Science 2016-01-06 Grzegorz Kurzejamski , Jacek Zawistowski , Grzegorz Sarwas

When selecting multiple candidates based on approval preferences of agents, the proportional representation of agents' opinions is an important and well-studied desideratum. Existing criteria for evaluating the representativeness of…

Computer Science and Game Theory · Computer Science 2024-10-02 Markus Brill , Jonas Israel , Evi Micha , Jannik Peters

In computational social choice, the distortion of a voting rule quantifies the degree to which the rule overcomes limited preference information to select a socially desirable outcome. This concept has been investigated extensively, but…

Computer Science and Game Theory · Computer Science 2023-12-11 Yannai A. Gonczarowski , Gregory Kehne , Ariel D. Procaccia , Ben Schiffer , Shirley Zhang

We present a method of variable selection for the sparse generalized additive model. The method doesn't assume any specific functional form, and can select from a large number of candidates. It takes the form of incremental forward…

Machine Learning · Statistics 2018-05-29 Tianwei Yu

This paper is an axiomatic study of consistent approval-based multi-winner rules, i.e., voting rules that select a fixed-size group of candidates based on approval ballots. We introduce the class of counting rules and provide an axiomatic…

Computer Science and Game Theory · Computer Science 2019-11-13 Martin Lackner , Piotr Skowron

We define a family of runoff rules that work as follows: voters cast approval ballots over candidates; two finalists are selected; and the winner is decided by majority. With approval-type ballots, there are various ways to select the…

Computer Science and Game Theory · Computer Science 2023-01-27 Théo Delemazure , Jérôme Lang , Jean-François Laslier , Remzi M. Sanver

We extend Approval voting to the settings where voters may have intransitive preferences. The major obstacle to applying Approval voting in these settings is that voters are not able to clearly determine who they should approve or…

Computer Science and Game Theory · Computer Science 2017-02-28 Yongjie Yang

Diffusive representations of fractional differential and integral operators can provide a convenient means to construct efficient numerical algorithms for their approximate evaluation. In the current literature, many different variants of…

Numerical Analysis · Mathematics 2024-07-15 Kai Diethelm

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…

Artificial Intelligence · Computer Science 2012-03-15 Nina Narodytska , Toby Walsh , Lirong Xia

We consider the problem of detecting an abrupt change in the distribution of a sequentially observed stochastic process. We establish the optimality of the CUSUM test with respect to a modified version of Lorden's criterion for arbitrary…

Statistics Theory · Mathematics 2012-07-13 Alexandra Chronopoulou , Georgios Fellouris

A committee's decisions on more than two alternatives much depend on the adopted voting method, and so does the distribution of power among the committee members. We investigate how different aggregation methods such as plurality runoff,…

Computer Science and Game Theory · Computer Science 2021-02-15 Sascha Kurz , Alexander Mayer , Stefan Napel

We study the predictable representation property in the progressive enlargement F^\tau of a reference filtration F by a random time \tau. Our approach is based on the decomposition of any random time into two parts, one overlapping…

Probability · Mathematics 2024-06-21 Antonella Calzolari , Barbara Torti