Search Results

This is an interesting question. An expert in social choice would have an interesting reply. As a semi-expert I can say semi-interesting things. As you may know, a common voting setting in social choi …

Since this is a well-studied problem, people will be a bit skeptical that you have found a significant improvement that is correct. I would try to look for someone you can contact via email and ask to …

As you said, the sum is $\Pr[X \leq \alpha n]$ where $X$ is drawn from a Binomial distribution with $n$ trials having $p$ probability of success. Bounds on this sum (for $\alpha < p$) are called "tail …

Throw $m$ balls into $n$ bins independently, each ball selecting a bin from the distribution $A \in \Delta_n$. This question is about lower-bounding the max-loaded bin. Background. In this MO answer I …

If you only want upper bounds, there is a nice approach based on collisions. (Proving that the max-loaded bin is not too small w.h.p. seems to need completely different techniques.) Define a $k$-way …

The contrapositive of PH is: If you put at most one pigeon per hole, then you have at most $n$ pigeons. Letting $a = (1,\dots,1)$ and $b_i$ be the number of pigeons in hole $i$ with $b_i \in \{0,1\}$, …

Fleshing out Boris Bukh's idea. We can draw $\pi$ by first sending $1$ uniformly to somewhere in $\{1,\dots,n\}$, then sending $2$ uniformly to the remaining $n-1$ spots, and so on. Consider a small …

I think we can use a greedy-type algorithm based on topological sorting into layers. Due to Tony's answer, we know we can ignore the no-shortcuts assumption, so take any DAG with in-degree and out-deg …

The answer is indeed asymptotic to $4n/\log(n)$, but I don't know of an elementary or easy construction for this upper bound. I believe simple probabilistic-method type constructions do not work. Thi …

You can use a "dynamic programming" solution. For anyone unfamiliar with this terms, the basic idea is that there are an exponential in $n,m$ number of possible paths, so it takes too long to enumerat …

I wonder if this perhaps-naive approach can help you. Let's shift by the mean, so consider $X = \sum_{j=1}^n X_j$ where each $X_j = 0.5$ or $-0.5$ independently with one-half probability each. So $\ma …

Intuitively, it should approach zero fast as soon as $|\mathcal S_{\mathsf{big}}|$ is at all smaller than $n$ (even like $n/2$) because virtually all subsets $\mathcal S_{\mathsf{small}}$ will contain …

Consider the bipartite graph whose left vertices are goods and right vertices are buyers. Draw an edge between each good $i$ and buyer $m$ with weight $p_{mi}$. Now, you want to find a max-weight bipa …

Here's one. You can think of the graph construction process as gradually building a set $S$ of vertices that have been touched so far, beginning with a random two vertices. Let $S_k$ be the set of the …

I am looking for a construction that can be stated as the following coding problem: a binary code with good distance ($d = \Omega(n)$ where codeword length is $n$) that "resists local decoding" in the …