## Abstract The consensus ranking problem has received much attention in the statistical literature. Given __m__ rankings of __n__ objects the objective is to determine a consensus ranking. The input rankings may contain ties, be incomplete, and may be weighted. Two solution concepts are discussed,
The minmax multidimensional knapsack problem with application to a chance-constrained problem
β Scribed by Moshe Kress; Michal Penn; Maria Polukarov
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 136 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
As a metaheuristic to obtain solutions of enhanced quality, we formulate the so-called pilot method. It is a tempered greedy method that is to avoid the greedy trap by looking ahead for each possible choice (memorizing the best result). Repeatedly, a so-called master solution is modified, each time
In this paper, we investigate a probabilistic local majority polling game on weighted directed graphs, keeping an application to the distributed agreement problem in mind. We formulate the game as a Markov chain, where an absorbing state corresponds to a system configuration that an agreement is ach