相关论文: Nice Bounds for the Generalized Ballot Problem
In this note, we find an equivalent boundary integral equation to the classical $\bar{\partial}$-Neumann problem. The new equation contains an equivalent regularity to the global regularity of the $\bar{\partial}$-Neumann problem. We also…
Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…
This note proves a law of large numbers for predicting several steps ahead, which, in the case of uniformly bounded random variables, generalizes the standard law of large numbers for martingales; the standard law of large numbers…
We prove an analogue of the classical ballot theorem that holds for any random walk in the range of attraction of the normal distribution. Our result is best possible: we exhibit examples demonstrating that if any of our hypotheses are…
We consider 2-player games played on a finite state space for infinite rounds. The games are concurrent: in each round, the two players choose their moves simultaneously; the current state and the moves determine the successor. We consider…
We study constrained selection sets of random closed sets defined on a non-atomic probability space. Given a random interval $Y=[y_L,y_U]$ and scalar constraints on the expectation or the median of admissible selections, we characterize the…
We study a combinatorial game derived from a problem in the German National Mathematics Competition. In this game, two players take turns removing numbers from a finite set of natural numbers, aiming to satisfy a certain divisibility…
We consider moderately trimmed sums of non-negative i.i.d. random variables. We show that for every distribution function there exists a proper moderate trimming such that for the trimmed sum a non-trivial strong law of large numbers holds.…
We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show…
We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning…
We prove that the constructive weighted coalitional manipulation problem for the Schulze voting rule can be solved in polynomial time for an unbounded number of candidates and an unbounded number of manipulators.
Generalizing a problem posed by Cover, we propose an adversarial game in which a permutation is incrementally constructed in a setting of partial information. As in the secretary problem, this permutation is exposed in stages via the…
Estimating and optimizing Mutual Information (MI) is core to many problems in machine learning; however, bounding MI in high dimensions is challenging. To establish tractable and scalable objectives, recent work has turned to variational…
We establish the multiplicity of positive solutions to a quasilinear Neumann problem in expanding balls and hemispheres with critical exponent in the boundary condition.
We present three versions of the classic two-pile game \textsc{one-or-one-or-one-of-both} generalized to the multi-pile context. In each case, we explore the resulting $\mathcal{P}$-positions. In the first version, there is a simple…
An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems, solving univariate polynomials, solving systems of…
We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…
The majority problem is a special case of the heavy hitters problem. Given a collection of coloured balls, the task is to identify the majority colour or state that no such colour exists. Whilst the special case of two-colours has been well…
Contributing to the toolbox for interpreting election results, we evaluate the robustness of election winners to random noise. We compare the robustness of different voting rules and evaluate the robustness of real-world election winners…
We generalize the joints problem to sets of varieties and prove almost sharp bound on the number of joints. As a special case, given a set of $N$ $2$-planes in $\mathbb{R}^6$, the number of points at which three $2$-planes intersect and…