Abstract
We present an algorithm which solves the vote assignment problem for antichains consisting solely of sets with cardinality 2. Then we prove that vote assignable graphs correspond to the well known threshold graphs. Finally we show how to achieve aggregation of inequalities by solving a vote assignability problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
V. Chvátal, P. L. Hammer: Aggregation of Inequalities in Integer Programming, Annals of Discrete Mathematics 1 (1977), pp. 145–162.
H. Garcia-Molina, D. Barbara: Optimizing the Reliability Provided by Voting Mechanisms, Proc. 4th International Conference on Distributed Computing Systems (1984), pp. 340–346.
D. K. Gifford: Weighted Voting for Replicated Data, Proc. 7th Symposium on Operating System Principles (1979), pp. 150–162.
M. C. Golumbic: Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.
J. Orlin: The Minimal Integral Separator of a Threshold Graph, Annals of Discrete Mathematics 1 (1977), pp. 415–419.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rank, C. (1996). The vote assignment problem and its relation to threshold graphs. In: Kleinschmidt, P., Bachem, A., Derigs, U., Fischer, D., Leopold-Wildburger, U., Möhring, R. (eds) Operations Research Proceedings 1995. Operations Research Proceedings, vol 1995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80117-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-80117-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60806-6
Online ISBN: 978-3-642-80117-4
eBook Packages: Springer Book Archive