IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2609.17836.html

Coalition strategy-proof anonymous binary social choice in a countably infinite society

Author

Listed:
  • Achille Basile
  • K. P. S. Bhaskara Rao
  • Surekha Rao

Abstract

We study anonymous binary social choice functions on the universal weak-preference domain when the society of voters is countably infinite. Voters may strictly support one of the two alternatives or be indifferent, and non-manipulability is required in the form of coalitional strategy-proofness. Full anonymity reduces the relevant information about a coalition not to its cardinality alone, but to its cardinality signature: finite of size \(k\), infinite with infinite complement, or cofinite with complement of size \(k\). Recording the signatures of the two strict-support coalitions yields an infinite triangular grid, ordered by increasing support for one alternative and decreasing support for the other. We prove that anonymous coalition strategy-proof binary social choice functions are exactly those obtained from super order closed subsets, i.e. upper sets, of this grid. We then give a geometric classification of these subsets. Unlike in the finite-voter case, they need not be generated by their minimal elements: countable infinity creates missing-boundary regions corresponding to finite opposition or cofinite strict support. We prove an exact representation of these subsets by genuine or missing-boundary corners, and derive a nonredundant parametrization by an antichain and, when necessary, one exceptional missing-boundary region. This yields four generalized zigzag forms and completes the infinite-society counterpart of the known geometric representation for finite electorates.

Suggested Citation

  • Achille Basile & K. P. S. Bhaskara Rao & Surekha Rao, 2026. "Coalition strategy-proof anonymous binary social choice in a countably infinite society," Papers 2609.17836, arXiv.org.
  • Handle: RePEc:arx:papers:2609.17836
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2609.17836
    File Function: Latest version
    Download Restriction: no
    ---><---

    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:arx:papers:2609.17836. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    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.