English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Pro

Presents the zaia usage as premium feature

ZAIA

Presents AI Discovery search usage as a premium feature

AI Discovery

Presents AI Discovery explain and summary usage as a premium feature

Content Analysis

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Presents the pdf analysis as premium feature

PDF Analysis

1500 Top-up

3000 Top-up

Zendy Basic

2500 Top-up

Zendy Unlimited

Presents the access of premium content as premium feature

Premium Content

We characterize the class of Arrovian Social Welfare Functions (ASWFs) as integer solutions to a collection of linear inequalities. Many of the classical possibility, impossibility, and characterization results can be derived in a simple and unified way from this integer program. Among the new results we derive is a characterization of preference domains that admit a nondictatorial, neutral ASWF. We also give a polyhedral characterization of all ASWFs on single-peaked domains. 1. Introduction. The Old Testament likens the generations of men to the leaves of a tree. It is a simile that applies as aptly to the literature inspired by Arrow's Impossibil- ity Theorem (Arrow 1963). Much of it is devoted to classifying those preference domains that admit or exclude the existence of a nondictatorial Arrovian Social Welfare Function (ASWF). (An ASWF is a social welfare function that satisfies the axioms of the Impossi- bility Theorem.) We add another leaf to that tree. Here we characterize the class of ASWFs as solutions to an integer program. This formulation allows us to derive in a systematic way many of the known results about ASWFs. It is inspired by a characterization of Arrovian domains due to Kalai and Muller (1977).

Integer Programming and Arrovian Social Welfare Functions