Numerical representation of intransitive preferences on a countable set (Q1054247): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0531(83)90103-5 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084023542 / rank | |||
Revision as of 07:13, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical representation of intransitive preferences on a countable set |
scientific article |
Statements
Numerical representation of intransitive preferences on a countable set (English)
0 references
1983
0 references
Let \(\succ\) be a preference relation on a countable set \(X\). The author proves that if \(\succ\) is acyclic (that is, has irreflexive transitive-closure), then there exists a map \(u\colon X\to\mathbb R\) such that \(x\succ y\) entails \(u(x)\succ u(y)\). He also extends, and gives a simple proof of, a theorem of Fishburn which provides representations of an interval order.
0 references
representations of an interval order
0 references
acyclic preference relation
0 references
