Nice Bounds for the Generalized Ballot Problem
Combinatorics
2009-12-11 v1 Computer Science and Game Theory
Abstract
This paper gives two sharp bounds for the generalized ballot problem with candidate A receiving at least \mu times as candidate B for an arbitrary real number \mu.
Keywords
Cite
@article{arxiv.0912.1999,
title = {Nice Bounds for the Generalized Ballot Problem},
author = {Delong Meng},
journal= {arXiv preprint arXiv:0912.1999},
year = {2009}
}