Abstract
In this paper, we show that Arrow's and Wilson's theorems hold for permutation, symmetric permutation and symmetric domains. Permutation domains concern assignments: n indivisible private goods are distributed betweenn selfish individuals. Symmetric permutation domains concern matchings: two sets ofn selfish individuals being given, pairs with an individual from each set are to be made. Symmetric domains concern pairings: a set of 2n selfish individuals being given,n pairs of individuals are to be made.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
