IDEAS home Printed from https://ideas.repec.org/p/cla/levrem/122247000000001616.html
   My bibliography  Save this paper

Approximability and Inapproximability of Dodgson and Young Elections

Author

Listed:
  • Ariel D Procaccia
  • Michal Feldmany
  • Jeffrey S Rosenschein

Abstract

No abstract is available for this item.

Suggested Citation

  • Ariel D Procaccia & Michal Feldmany & Jeffrey S Rosenschein, 2007. "Approximability and Inapproximability of Dodgson and Young Elections," Levine's Bibliography 122247000000001616, UCLA Department of Economics.
    • Handle: RePEc:cla:levrem:122247000000001616
    as

    Download full text from publisher

    File URL: http://ratio.huji.ac.il/dp_files/dp466.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Young, H. P., 1977. "Extending Condorcet's rule," Journal of Economic Theory, Elsevier, vol. 16(2), pages 335-353, December.
    2. Christian Klamler, 2004. "The Dodgson ranking and its relation to Kemeny’s method and Slater’s rule," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 23(1), pages 91-102, August.
    3. H. W. Lenstra, 1983. "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 538-548, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ariel D. Procaccia & Michal Feldmany & Jeffrey S. Rosenschein, 2007. "Approximability and Inapproximability of Dodgson and Young Elections," Discussion Paper Series dp466, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    2. K. Aardal & R. E. Bixby & C. A. J. Hurkens & A. K. Lenstra & J. W. Smeltink, 2000. "Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 192-202, August.
    3. Holliday, Wesley H., 2024. "An impossibility theorem concerning positive involvement in voting," Economics Letters, Elsevier, vol. 236(C).
    4. Berghammer, Rudolf & Schnoor, Henning, 2015. "Control of Condorcet voting: Complexity and a Relation-Algebraic approach," European Journal of Operational Research, Elsevier, vol. 246(2), pages 505-516.
    5. Alberto Del Pia & Robert Hildebrand & Robert Weismantel & Kevin Zemmer, 2016. "Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 511-530, May.
    6. Mostapha Diss & Eric Kamwa & Abdelmonaim Tlidi, 2019. "On some k-scoring rules for committee elections: agreement and Condorcet Principle," Working Papers hal-02147735, HAL.
    7. Cascón, J.M. & González-Arteaga, T. & de Andrés Calle, R., 2019. "Reaching social consensus family budgets: The Spanish case," Omega, Elsevier, vol. 86(C), pages 28-41.
    8. Friedrich Eisenbrand & Gennady Shmonin, 2008. "Parametric Integer Programming in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 839-850, November.
    9. Masing, Berenike & Lindner, Niels & Borndörfer, Ralf, 2022. "The price of symmetric line plans in the Parametric City," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 419-443.
    10. Hannu Nurmi, 2004. "A Comparison of Some Distance-Based Choice Rules in Ranking Environments," Theory and Decision, Springer, vol. 57(1), pages 5-24, August.
    11. Danny Nguyen & Igor Pak, 2020. "The Computational Complexity of Integer Programming with Alternations," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 191-204, February.
    12. Akbari, Sina & Escobedo, Adolfo R., 2023. "Beyond kemeny rank aggregation: A parameterizable-penalty framework for robust ranking aggregation with ties," Omega, Elsevier, vol. 119(C).
    13. Sascha Kurz & Nikolas Tautenhahn, 2013. "On Dedekind’s problem for complete simple games," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 411-437, May.
    14. Elizabeth Baldwin & Paul Klemperer, 2019. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities," Econometrica, Econometric Society, vol. 87(3), pages 867-932, May.
    15. Jérôme Lang & Gabriella Pigozzi & Marija Slavkovik & Leendert Torre & Srdjan Vesic, 2017. "A partial taxonomy of judgment aggregation rules and their properties," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(2), pages 327-356, February.
    16. Herbert E. Scarf & David F. Shallcross, 2008. "The Frobenius Problem and Maximal Lattice Free Bodies," Palgrave Macmillan Books, in: Zaifu Yang (ed.), Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research, chapter 7, pages 149-153, Palgrave Macmillan.
    17. Elhedhli, Samir & Naoum-Sawaya, Joe, 2015. "Improved branching disjunctions for branch-and-bound: An analytic center approach," European Journal of Operational Research, Elsevier, vol. 247(1), pages 37-45.
    18. Mauro Dell’Amico & Simone Falavigna & Manuel Iori, 2015. "Optimization of a Real-World Auto-Carrier Transportation Problem," Transportation Science, INFORMS, vol. 49(2), pages 402-419, May.
    19. Christian Klamler, 2005. "On the Closeness Aspect of Three Voting Rules: Borda – Copeland – Maximin," Group Decision and Negotiation, Springer, vol. 14(3), pages 233-240, May.
    20. Edith Elkind & Piotr Faliszewski & Arkadii Slinko, 2015. "Distance rationalization of voting rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 45(2), pages 345-377, September.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cla:levrem:122247000000001616. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: David K. Levine (email available below). General contact details of provider: http://www.dklevine.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.