Additive Representations of Preferences: A New Foundation of by P.P. Wakker

By P.P. Wakker

`This e-book represents a truly genuine and demanding contribution to the maths of selection idea.
The distinguishing function of Wakker's process is that he has no use of a reference experiment.
There are extra effects aplenty and masses for the choice theorist to give some thought to. those effects also will aid psychologists, economists and others formulate and try out versions of decision-making behaviour.
via any criteria its ebook is a landmark ... very good survey and precis of the literature on additive choice types. each one web page represents the distillation of a lot suggestion. as a result, it's a publication that rewards examining and rereading. Wakker's effects and strategies of facts will enlighten study into determination idea for plenty of years.'
British magazine of Mathematical and Statistical Psychology, forty three, 1990

Show description

Read Online or Download Additive Representations of Preferences: A New Foundation of Decision Analysis PDF

Best operations research books

Business Dynamics in Information Technology

Rising company versions, worth configurations, and knowledge applied sciences engage over the years to create aggressive virtue. smooth info know-how should be studied, understood, and utilized alongside the time size of months and years, the place alterations are the rule of thumb. Such alterations created via interactions among enterprise components and assets are rather well fitted to procedure dynamics modeling.

Hybrid Optimization: The Ten Years of CPAIOR

This quantity specializes in the mixing of man-made intelligence and constraint programming to unravel difficulties in operations study and combinatorial optimization. This quantity collects the contributions of specialists from numerous examine parts together with determination concept, structures engineering, propositional satisfiability, mathematical optimization, and synthetic intelligence.

Entscheidungsverfahren für komplexe Probleme: Ein heuristischer Ansatz

Das Treffen von Entscheidungen von großer Tragweite bildet die wichtigste Aufgabe von Führungskräften. Es handelt sich dabei um eine schwierige Aufgabe, weil die bedeutsamen Entscheidungen meist auch komplex sind. Das vorliegende Buch stellt ein Entscheidungsverfahren vor, mit dessen Hilfe komplexe Probleme schrittweise bearbeitet werden können.

The Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management (Springer Series in Operations Research and Financial Engineering)

Fierce pageant in cutting-edge worldwide marketplace presents a robust motivation for constructing ever extra subtle logistics structures. This e-book, written for the logistics supervisor and researcher, offers a survey of the fashionable conception and alertness of logistics. The target of the e-book is to provide the cutting-edge within the technology of logistics administration.

Additional resources for Additive Representations of Preferences: A New Foundation of Decision Analysis

Sample text

Y. Were now y ~. x' for all 0 :s k:s t:s m, contradicting xiPxi+l. So x >.. y, and ,... must extend P. For the demonstration of (vi) => (ii), suppose xPy. Then xPy, so by (vi) not yRx, and (ii) follows. For (i) => (vi), first note that by (i), xPy implies, by the furthermore-statement, that not yRx. Since xPy => xRy always holds true, [xPy) => [xRy and not yRx) follows. To establish the reversed implication, suppose that [xRy and not yRx). Then x = xORxl ... Rxm = y can be arranged. To prevent y = xmRxm-lR ...

Some derivations, such as in Keeney&Raiffa(I976), or French(I986, Chapter 4), are easily accessible and appealing, but do not elaborate details (mainly topological details). Or derivations require a study of results from advanced mathematical theories, such as web theory in Debreu(1960), functional equations in Katzner(I970) and Blackorby,Primont& Russell(1978, elaborating Gorman,1968), group theory in KLST and Fuhrken&Richter (1988), or the theory of mean groupoids as in Vind(1986a). Somewhere in between are the derivations in Koopmans(I972) and Fishburn(I970).

2. 7. Again we shall often say by weak separability when in fact we use this lemma. 1. Let ~ be a weakly separable continuous weak order. Then every continuous weak order. ~i is a PROOF. 7 every ~i is a weak order. Let Z be an arbitrary fixed alternative. The set {xi E r i : xi ~j yj} = {Xj E rj : Z_jXj ~. 1 the set {xi E r i : Xj ~ j Yi} must be closed. Analogously the set {Xj E r i : Xj ~i Yi} is closed. Continuity of ~i follows. o Next we make explicit the topological assumption that we shall mostly use in the sequel.

Download PDF sample

Rated 4.41 of 5 – based on 28 votes