相关论文: Piercing Numbers in Circular Societies
A multicriteria group choice problem is considered in the paper. The model includes a set of feasible alternatives, a vector criterion, and n preference relations of the decision makers (DMs). Each preference relation is a cone relation…
We construct a sample of numerical models for clusters of galaxies and employ these to investigate their capability of imaging background sources into long arcs. Emphasis is laid on the statistics of these arcs. We study cross sections for…
We consider a discrete-time voter model process on a set of nodes, each being in one of two states, either 0 or 1. In each time step, each node adopts the state of a randomly sampled neighbor according to sampling probabilities, referred to…
We consider a non stationary multi-armed bandit in which the population preferences are positively and negatively reinforced by the observed rewards. The objective of the algorithm is to shape the population preferences to maximize the…
In the design and analysis of political redistricting maps, it is often useful to be able to sample from the space of all partitions of the graph of census blocks into connected subgraphs of equal population. There are influential Markov…
In the Popular Matching problem, we are given a bipartite graph $G = (A \cup B, E)$ and for each vertex $v\in A\cup B$, strict preferences over the neighbors of $v$. Given two matchings $M$ and $M'$, matching $M$ is more popular than $M'$…
Voting is a simple mechanism to aggregate the preferences of agents. Many voting rules have been shown to be NP-hard to manipulate. However, a number of recent theoretical results suggest that this complexity may only be in the worst-case…
A set of $2^n$ candidates is presented to a commission. At every round, each member of this commission votes by pairwise comparison, and one-half of the candidates is deleted from the tournament, the remaining ones proceeding to the next…
A preference system $\mathcal{I}$ is an undirected graph where vertices have preferences over their neighbors, and $\mathcal{I}$ admits a master list if all preferences can be derived from a single ordering over all vertices. We study the…
Consider the voter model on a box of side length $L$ (in the triangular lattice) with boundary votes fixed forever as type 0 or type 1 on two different halves of the boundary. Motivated by analogous questions in percolation, we study…
This paper presents an algorithm for enumerating biases in word embeddings. The algorithm exposes a large number of offensive associations related to sensitive features such as race and gender on publicly available embeddings, including a…
We address the polling problem in social networks where individuals collaborate to choose the most favorite choice amongst some options, without divulging their vote and publicly exposing their potentially malicious actions. Given this…
Participatory budgeting (PB) is a democratic paradigm whereby voters decide on a set of projects to fund with a limited budget. We consider PB in a setting where voters report ordinal preferences over projects and have (possibly) asymmetric…
The task of approximating points with circular arcs is performed in many applications, such as polyline compression, noise filtering, and feature recognition. However, the development of algorithms that perform a significant amount of…
This paper builds upon the work of Dougherty and Heckelman (2020) by determining the frequency that 13 voting systems violate Arrow's social choice criteria with up to six alternatives. These results determine which of the 13 voting…
Social decision schemes (SDSs) map the ordinal preferences of individual voters over multiple alternatives to a probability distribution over the alternatives. In order to study the axiomatic properties of SDSs, we lift preferences over…
We propose new polymer models for Monte Carlo simulation and apply them to a polymer chain confined in a relatively thin box which has both curved and flat sides, and show that either an ideal or an excluded-volume chain spends more time in…
The integrity of elections is central to democratic systems. However, a myriad of malicious actors aspire to influence election outcomes for financial or political benefit. A common means to such ends is by manipulating perceptions of the…
Given a graph $G$ and a vertex $q\in G$, the community search (CS) problem aims to efficiently find a subgraph of $G$ whose vertices are closely related to $q$. Communities are prevalent in social and biological networks, and can be used in…
A method is given for quantitatively rating the social acceptance of different options which are the matter of a complete preferential vote. Completeness means that every voter expresses a comparison (a preference or a tie) about each pair…