Preference as fulfilment of desires
We consider preferences as fulfillment of conditional desires, which can be either positive or negative, or both. We go beyond the standard multi-attributive additive utility theory in the sense that we separate the data given by the preference relation over an unstructured space from the property s...
Saved in:
Main Authors: | , |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=62949200230&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/49250 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
id |
th-cmuir.6653943832-49250 |
---|---|
record_format |
dspace |
spelling |
th-cmuir.6653943832-492502018-08-16T02:18:44Z Preference as fulfilment of desires Marc Arthur Diaye Daniel Schoch Mathematics Psychology We consider preferences as fulfillment of conditional desires, which can be either positive or negative, or both. We go beyond the standard multi-attributive additive utility theory in the sense that we separate the data given by the preference relation over an unstructured space from the property structure representing (conditional) attributes or desires. The model accounts for the psychologically motivated and empirically confirmed asymmetry between desire fulfillment and disappointment (loss aversion). The only restriction on the set of desires is, loosely speaking, a kind of mutual logical independence. We formulate a representation theorem characterising when a weak order (i.e. complete and transitive) preference is compatible with the logical structure of desires and has an additive representation over it. It is unique in the sense that each utility function representing the preferences has at most one such additive decomposition. © 2009 Elsevier Inc. All rights reserved. 2018-08-16T02:13:13Z 2018-08-16T02:13:13Z 2009-04-01 Journal 10960880 00222496 2-s2.0-62949200230 10.1016/j.jmp.2009.01.003 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=62949200230&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/49250 |
institution |
Chiang Mai University |
building |
Chiang Mai University Library |
country |
Thailand |
collection |
CMU Intellectual Repository |
topic |
Mathematics Psychology |
spellingShingle |
Mathematics Psychology Marc Arthur Diaye Daniel Schoch Preference as fulfilment of desires |
description |
We consider preferences as fulfillment of conditional desires, which can be either positive or negative, or both. We go beyond the standard multi-attributive additive utility theory in the sense that we separate the data given by the preference relation over an unstructured space from the property structure representing (conditional) attributes or desires. The model accounts for the psychologically motivated and empirically confirmed asymmetry between desire fulfillment and disappointment (loss aversion). The only restriction on the set of desires is, loosely speaking, a kind of mutual logical independence. We formulate a representation theorem characterising when a weak order (i.e. complete and transitive) preference is compatible with the logical structure of desires and has an additive representation over it. It is unique in the sense that each utility function representing the preferences has at most one such additive decomposition. © 2009 Elsevier Inc. All rights reserved. |
format |
Journal |
author |
Marc Arthur Diaye Daniel Schoch |
author_facet |
Marc Arthur Diaye Daniel Schoch |
author_sort |
Marc Arthur Diaye |
title |
Preference as fulfilment of desires |
title_short |
Preference as fulfilment of desires |
title_full |
Preference as fulfilment of desires |
title_fullStr |
Preference as fulfilment of desires |
title_full_unstemmed |
Preference as fulfilment of desires |
title_sort |
preference as fulfilment of desires |
publishDate |
2018 |
url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=62949200230&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/49250 |
_version_ |
1681423376216752128 |