On the Combinatorial Structure of the Approval-Voting Polytope
β Scribed by Jean-Paul Doignon; Michel Regenwetter
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 131 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0022-2496
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
asked for estimates for the number of equivalence classes of lattice polytopes, under the group of unimodular affine transformations. What we investigate here is the analogous question for lattice free polytopes. Some of the results: the number of equivalence classes of lattice free simplices of vol
By the theory of Vassiliev invariants, the knowledge of a certain algebra B, defined as generated by graphs, is essentially as good as the knowledge of the space of Vassiliev invariants. We will prove that the subspace B c 2, u of B generated by all connected diagrams with 4+2u vertices, including u
Define the transportation polytope T n,m to be a polytope of non-negative n Γ m matrices with row sums equal to m and column sums equal to n. We present a new recurrence relation for the numbers f k of the k-dimensional faces for the transportation polytope T n,n+1 . This gives an efficient algorith
Many countries are forging ahead with convenient balloting methods, in particular electronic and postal voting, in order to reβengage voters. In this paper, we test whether the cost reductions through postal voting increase turnout. The empirical analysis is based on a newly collected data set on th