Relative Nash welfarism
dc.contributor.author | Sprumont, Yves | |
dc.date.accessioned | 2017-12-14T16:24:49Z | |
dc.date.available | 2017-12-14T16:24:49Z | |
dc.date.issued | 2017-09 | |
dc.identifier.uri | http://hdl.handle.net/1866/19683 | |
dc.publisher | Université de Montréal. Département de sciences économiques. | fr |
dc.subject | Preference aggregation | fr |
dc.subject | Lotteries | fr |
dc.subject | Relative utilitarianism | fr |
dc.subject | Nash product | fr |
dc.title | Relative Nash welfarism | fr |
dc.type | Article | fr |
dc.contributor.affiliation | Université de Montréal. Faculté des arts et des sciences. Département de sciences économiques | |
dcterms.abstract | Relative Nash welfarism is a solution to the problem of aggregating von Neumann-Morgenstern preferences over a set of lotteries. It ranks such lotteries according to the product of any collection of 0-normalized von Neumann-Morgenstern utilities they generate. We show that this criterion is characterized by the Weak Pareto Principle, Anonymity, and Independence of Harmless Expansions: the social ranking of two lotteries is unaffected by the addition of any alternative that every agent deems at least as good as the one she originally found worst. Relative Nash welfarism is more appealing than relative utilitarianism in contexts where the best relevant alternative for an agent is difficult to identify with confidence. | fr |
dcterms.isPartOf | urn:ISSN:0709-9231 | |
dcterms.language | eng | fr |
UdeM.VersionRioxx | Version publiée / Version of Record | |
oaire.citationTitle | Cahier de recherche | |
oaire.citationIssue | 2017-03 |
Files in this item
This item appears in the following Collection(s)
This document disseminated on Papyrus is the exclusive property of the copyright holders and is protected by the Copyright Act (R.S.C. 1985, c. C-42). It may be used for fair dealing and non-commercial purposes, for private study or research, criticism and review as provided by law. For any other use, written authorization from the copyright holders is required.