相关论文: Nice Bounds for the Generalized Ballot Problem

Predicting the winner of an election is a favorite problem both for news media pundits and computational social choice theorists. Since it is often infeasible to elicit the preferences of all the voters in a typical prediction scenario, a…

We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…

We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…

We study the design of voting rules in the metric distortion framework. It is known that any deterministic rule suffers distortion of at least $3$, and that randomized rules can achieve distortion strictly less than $3$, often at the cost…

The Bayesian framework is ideally suited for induction problems. The probability of observing $x_t$ at time $t$, given past observations $x_1...x_{t-1}$ can be computed with Bayes' rule if the true distribution $\mu$ of the sequences…

Answering an open question by Betzler et al. [Betzler et al., JAIR'13], we resolve the parameterized complexity of the multi-winner determination problem under two famous representation voting rules: the Chamberlin-Courant (in short CC)…

In this note, we give examples that demonstrate a negative answer to the generalized numerical criterion problem for pairs.

We introduce a very natural generalization of the well-known problem of simultaneous congruences. Instead of searching for a positive integer $s$ that is specified by $n$ fixed remainders modulo integer divisors $a_1,\dots,a_n$ we consider…

The finite colliding bullets problem is the following simple problem: consider a gun, whose barrel remains in a fixed direction; let $(V_i)_{1\le i\le n}$ be an i.i.d.\ family of random variables with uniform distribution on $[0,1]$; shoot…

The General Lotto game is a popular variant of the famous Colonel Blotto game, in which two opposing players allocate limited resources over many battlefields. In this paper, we consider incomplete and asymmetric information formulations…

We investigate the parameterized complexity of strategic behaviors in generalized scoring rules. In particular, we prove that the manipulation, control (all the 22 standard types), and bribery problems are fixed-parameter tractable for most…

We study strategic candidate positioning in multidimensional spatial-voting elections. Voters and candidates are represented as points in $\mathbb{R}^d$, and each voter supports the candidate that is closest under a distance induced by an…

We study the problem of designing multiwinner voting rules that are candidate monotone and proportional. We show that the set of committees satisfying the proportionality axiom of proportionality for solid coalitions is candidate monotone.…

We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swapping the positions of two consecutive candidates in his…

The goal of the classic football-pool problem is to determine how many lottery tickets are to be bought in order to guarantee at least $n-r$ correct guesses out of a sequence of $n$ games played. We study a generalized (second-order)…

We consider a variant of the randomly reinforced urn where more balls can be simultaneously drawn out and balls of different colors can be simultaneously added. More precisely, at each time-step, the conditional distribution of the number…

Extensions of the Boole--Frechet inequalities give sharp bounds for the probabilities of compound events, particularly when only the probabilities of atomic events (that make up the compound events) are known. We present a constructive…

The generalized allocation scheme is studied. Its extension for coloured balls is defined. Some analogues of the Law of the Iterated Logarithm and the Strong Law of Large Numbers are obtained for the number of boxes containing fixed numbers…

Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out…

We initiate the study of bribery problem in the context of gerrymandering and reverse gerrymandering. In our most general problem, the input is a set of voters having votes over a set of alternatives, a graph on the voters, a partition of…