相关论文: A Computational Approach to Measuring Vote Elastic…

The autonomous systems need to decide how to react to the changes at runtime efficiently. The ability to rigorously analyze the environment and the system together is theoretically possible by the model-driven approaches; however, the model…

We develop a model of multiwinner elections that combines performance-based measures of the quality of the committee (such as, e.g., Borda scores of the committee members) with diversity constraints. Specifically, we assume that the…

Parameter control and dynamic algorithm configuration study how to dynamically choose suitable configurations of a parametrized algorithm during the optimization process. Despite being an intensively researched topic in evolutionary…

The partitioning problem is of central relevance for designing and implementing non-centralized Model Predictive Control (MPC) strategies for large-scale systems. These control approaches include decentralized MPC, distributed MPC,…

We explicitly test if the reliability of credit ratings depends on the total number of admissible states. We analyse open access credit rating data and show that the effect of the number of states in the dynamical properties of ratings…

North Carolina's constitution requires that state legislative districts should not split counties. However, counties must be split to comply with the "one person, one vote" mandate of the U.S. Supreme Court. Given that counties must be…

In recent decades, state legislatures have often drawn U.S. Congressional voting districts that look---to the human eye---to be rather twisted. In this paper, we propose a method to measure how much districts "meander" via a computation of…

Democracies employ elections at various scales to select officials at the corresponding levels of administration. The geographical distribution of political opinion, the policy issues delegated to each level, and the multilevel interactions…

In the United States electoral system, a candidate is elected indirectly by winning a majority of electoral votes cast by individual states, the election usually being decided by the votes cast by a small number of "swing states" where the…

Optimal Markov Decision Process policies for problems with finite state and action space are identified through a partial ordering by comparing the value function across states. This is referred to as state-based optimality. This paper…

Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. However, if candidates have sensitive attributes such as gender or ethnicity (when selecting…

This paper studies algorithmic fairness when the protected attribute is location. To handle protected attributes that are continuous, such as age or income, the standard approach is to discretize the domain into predefined groups, and…

We present on-line policy gradient algorithms for computing the locally optimal policy of a constrained, average cost, finite state Markov Decision Process. The stochastic approximation algorithms require estimation of the gradient of the…

The study of fairness in multiwinner elections focuses on settings where candidates have attributes. However, voters may also be divided into predefined populations under one or more attributes (e.g., "California" and "Illinois" populations…

We consider a setting with agents that have preferences over alternatives and are partitioned into disjoint districts. The goal is to choose one alternative as the winner using a mechanism which first decides a representative alternative…

Criteria for a good voting system have been given particularly careful scrutiny in recent years, with general agreement that the core values are fair results, voter power and choice, and local representation. This paper reexamines the basic…

The Political Districting Problem is mapped to a $q$-state Potts model in which the constraints can be written as interactions between sites or external fields acting on the system. Districting into $q$ voter districts is equivalent to…

Motivated by the difficulty of specifying complete ordinal preferences over a large set of $m$ candidates, we study voting rules that are computable by querying voters about $t < m$ candidates. Generalizing prior works that focused on…

Elections and opinion polls often have many candidates, with the aim to either rank the candidates or identify a small set of winners according to voters' preferences. In practice, voters do not provide a full ranking; instead, each voter…

How much influence can a coordinated coalition exert in a multiwinner Top-$k$ election under a positional scoring rule? We study the maximum displacement problem: with coalition size $m$, how many of the current top-$k$ winners can be…