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

A Topological Condition for Aggregation on Weak Preference Domains

Author

Listed:
  • Sizhong Fang

Abstract

This paper provides a topological construction for studying social aggregation of weak preferences over a finite set of alternatives. We identify weak preferences with the cells of the type $A_{n-1}$ braid arrangement and, equivalently, with the simplices of the corresponding type $A_{n-1}$ Coxeter complex, which we call the preference complex. Then we define face-monotonicity by requiring a social welfare function to be order-preserving when viewed as a map between the preference-profile poset and the preference poset. We prove that if a common preference domain admits a unanimous, anonymous, and face-monotonic social welfare function, then every connected component of the geometric realization of its order complex is contractible. We then apply this construction to two restricted domains. For fixed-extrema domains, we prove that their order-complex realizations are contractible and define a unanimous, anonymous, and face-monotonic social welfare function using the meet operation. For single-peaked domains, we prove that the corresponding subcomplex of the preference complex has a contractible realization and, in the three-alternative case, construct a unanimous, anonymous, and face-monotonic social welfare function.

Suggested Citation

  • Sizhong Fang, 2026. "A Topological Condition for Aggregation on Weak Preference Domains," Papers 2609.35866, arXiv.org.
  • Handle: RePEc:arx:papers:2609.35866
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2609.35866
    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.35866. 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.