2002
DOI: 10.1007/978-3-662-04992-1
|View full text |Cite
|
Sign up to set email alerts
|

Utility Maximization, Choice and Preference

Abstract: The use of general descriptive narnes, registered narnes, trademarks, etc. in this publi cation does not imply, even in the absence of a specific statement, that such name s are exempt from the relevant protective laws and regulat ions and therefore free for general use.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
97
0
2

Year Published

2005
2005
2020
2020

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 83 publications
(102 citation statements)
references
References 0 publications
0
97
0
2
Order By: Relevance
“…In this family of methods, the expected utilities (probabilistically weighted figures of merit) associated with the outcomes of each decision option are compared, and the option with the greatest expected utility is selected (see, for example, Aleskerov et al 2007). Since the identities of the preferred decisions are sensitive to the input probability distributions (which can be contentious-see Section 2.2), there is often some reluctance in real-world settings to adopt such methods wholesale.…”
Section: Classical Decision Methodsmentioning
confidence: 99%
“…In this family of methods, the expected utilities (probabilistically weighted figures of merit) associated with the outcomes of each decision option are compared, and the option with the greatest expected utility is selected (see, for example, Aleskerov et al 2007). Since the identities of the preferred decisions are sensitive to the input probability distributions (which can be contentious-see Section 2.2), there is often some reluctance in real-world settings to adopt such methods wholesale.…”
Section: Classical Decision Methodsmentioning
confidence: 99%
“…. , last equivalence class of K. (Aleskerov, Bouyssou, and Monjardet 2007) that the relation K • defined letting, for all a, b, c ∈ A,…”
Section: Binary Relationsmentioning
confidence: 99%
“…In all these examples, we define by its boolean matrix, so that it is easy to check that the relations considered below are semiorders. Indeed, if it is possible to arrange the rows and columns of the boolean matrix in the same order so that the boolean matrix is stepped, we know that the relation is a semiorder (Aleskerov et al 2007). It is clear that this relation is a semiorder on X.…”
Section: A Proof Of Lemma 12mentioning
confidence: 99%
“…Basic references on this issue can be considered: [102], [161], [222], [103], [230], [152], [247], [251], [209], [105], [4], [199]. In this article we adopt the notation introduced in [230].…”
Section: Introduction and Notationmentioning
confidence: 99%