Validation des SCORES cliniques: notions théoriques et pratiques de base. [Validation of clinical scores: theoretical and practical basic notions].

Chaque jour, le médecin utilise dans sa pratique des scores cliniques. Ces scores sont souvent des aides à la décision médicale. Les étapes de validation des scores cliniques sont par contre souvent méconnues du médecin. Cette revue rappelle les bases théoriques de la validation d'un score clinique et propose des exercices pratiques. [Abstract] Physicians are using clinical scores on a regular basis. These scores are generally helpful in making medical decisions. However, the process of validation of clinical scores is often unknown to the physicians. This paper reviews the theory of validation of clinical scores and proposes practical exercises.

Consistency and the core of multi-sided assignment markets

[cat] En aquest treball es demostra que en el domini dels jocs d’assignació equilibrats multisectorials (Quint, 1991), el core és l’única solució no buida que satisfà derived consistency i projection consistency. També es caracteritza el core en tota la classe dels jocs d’assignació multisectorials amb els axiomes de singleness best, individual antimonotonicity i derived consistency. Com a casos particulars, s’obtenen dues noves axiomàtiques del core per als jocs d’assignació bilaterals (Shapley and Shubik, 1972).

The Banzhaf Value in the Presence of Externalities

[eng] We propose two generalizations of the Banzhaf value for partition function form games. In both cases, our approach is based on probability distributions over the set of possible coalition structures that may arise for any given set of agents. First, we introduce a family of values, one for each collection of the latter probability distributions, defined as the Banzhaf value of an expected coalitional game. Then, we provide two characterization results for this new family of values within the framework of all partition function games. Both results rely on a property of neutrality with respect to amalgamation of players. Second, as this collusion transformation fails to be meaningful for simple games in partition function form, we propose another generalization of the Banzhaf value which also builds on probability distributions of the above type. This latter family is characterized by means of a neutrality property which uses an amalgamation transformation of players for which simple games are closed.

Consistency and the core of multi-sided assignment markets

[cat] En aquest treball es demostra que en el domini dels jocs d’assignació equilibrats multisectorials (Quint, 1991), el core és l’única solució no buida que satisfà derived consistency i projection consistency. També es caracteritza el core en tota la classe dels jocs d’assignació multisectorials amb els axiomes de singleness best, individual antimonotonicity i derived consistency. Com a casos particulars, s’obtenen dues noves axiomàtiques del core per als jocs d’assignació bilaterals (Shapley and Shubik, 1972).

The Banzhaf Value in the Presence of Externalities

[eng] We propose two generalizations of the Banzhaf value for partition function form games. In both cases, our approach is based on probability distributions over the set of possible coalition structures that may arise for any given set of agents. First, we introduce a family of values, one for each collection of the latter probability distributions, defined as the Banzhaf value of an expected coalitional game. Then, we provide two characterization results for this new family of values within the framework of all partition function games. Both results rely on a property of neutrality with respect to amalgamation of players. Second, as this collusion transformation fails to be meaningful for simple games in partition function form, we propose another generalization of the Banzhaf value which also builds on probability distributions of the above type. This latter family is characterized by means of a neutrality property which uses an amalgamation transformation of players for which simple games are closed.

Indicators for the characterization of discrete Choquet integrals

Ordered weighted averaging (OWA) operators and their extensions are powerful tools used in numerous decision-making problems. This class of operator belongs to a more general family of aggregation operators, understood as discrete Choquet integrals. Aggregation operators are usually characterized by indicators. In this article four indicators usually associated with the OWA operator are extended to discrete Choquet integrals: namely, the degree of balance, the divergence, the variance indicator and Renyi entropies. All of these indicators are considered from a local and a global perspective. Linearity of indicators for linear combinations of capacities is investigated and, to illustrate the application of results, indicators of the probabilistic ordered weighted averaging -POWA- operator are derived. Finally, an example is provided to show the application to a specific context.

The connection between distortion risk measures and ordered weighted averaging operators

Distortion risk measures summarize the risk of a loss distribution by means of a single value. In fuzzy systems, the Ordered Weighted Averaging (OWA) and Weighted Ordered Weighted Averaging (WOWA) operators are used to aggregate a large number of fuzzy rules into a single value. We show that these concepts can be derived from the Choquet integral, and then the mathematical relationship between distortion risk measures and the OWA and WOWA operators for discrete and finite random variables is presented. This connection offers a new interpretation of distortion risk measures and, in particular, Value-at-Risk and Tail Value-at-Risk can be understood from an aggregation operator perspective. The theoretical results are illustrated in an example and the degree of orness concept is discussed.

Multidata inverse problems and Bayesian solution methods in astronomy

Statistical analyses of measurements that can be described by statistical models are of essence in astronomy and in scientific inquiry in general. The sensitivity of such analyses, modelling approaches, and the consequent predictions, is sometimes highly dependent on the exact techniques applied, and improvements therein can result in significantly better understanding of the observed system of interest. Particularly, optimising the sensitivity of statistical techniques in detecting the faint signatures of low-mass planets orbiting the nearby stars is, together with improvements in instrumentation, essential in estimating the properties of the population of such planets, and in the race to detect Earth-analogs, i.e. planets that could support liquid water and, perhaps, life on their surfaces. We review the developments in Bayesian statistical techniques applicable to detections planets orbiting nearby stars and astronomical data analysis problems in general. We also discuss these techniques and demonstrate their usefulness by using various examples and detailed descriptions of the respective mathematics involved. We demonstrate the practical aspects of Bayesian statistical techniques by describing several algorithms and numerical techniques, as well as theoretical constructions, in the estimation of model parameters and in hypothesis testing. We also apply these algorithms to Doppler measurements of nearby stars to show how they can be used in practice to obtain as much information from the noisy data as possible. Bayesian statistical techniques are powerful tools in analysing and interpreting noisy data and should be preferred in practice whenever computational limitations are not too restrictive.

Aspekte der linearen Minimax-Schätzung

Es werde das lineare Regressionsmodell y = X b + e mit den ueblichen Bedingungen betrachtet. Weiter werde angenommen, dass der Parametervektor aus einem Ellipsoid stammt. Ein optimaler Schaetzer fuer den Parametervektor ist durch den Minimax-Schaetzer gegeben. Nach der entscheidungstheoretischen Formulierung des Minimax-Schaetzproblems werden mit dem Bayesschen Ansatz, Spektralen Methoden und der Darstellung von Hoffmann und Laeuter Wege zur Bestimmung des Minimax- Schaetzers dargestellt und in Beziehung gebracht. Eine Betrachtung von Modellen mit drei Einflussgroeßen und gemeinsamen Eigenvektor fuehrt zu einer Strukturierung des Problems nach der Vielfachheit des maximalen Eigenwerts. Die Bestimmung des Minimax-Schaetzers in einem noch nicht geloesten Fall kann auf die Bestimmung einer Nullstelle einer nichtlinearen reellwertigen Funktion gefuehrt werden. Es wird ein Beispiel gefunden, in dem die Nullstelle nicht durch Radikale angegeben werden kann. Durch das Intervallschachtelungs-Prinzip oder Newton-Verfahren ist die numerische Bestimmung der Nullstelle moeglich. Durch Entwicklung einer Fixpunktgleichung aus der Darstellung von Hoffmann und Laeuter war es in einer Simulation moeglich die angestrebten Loesungen zu finden.

Reinforcement Learning by Policy Search

One objective of artificial intelligence is to model the behavior of an intelligent agent interacting with its environment. The environment's transformations can be modeled as a Markov chain, whose state is partially observable to the agent and affected by its actions; such processes are known as partially observable Markov decision processes (POMDPs). While the environment's dynamics are assumed to obey certain rules, the agent does not know them and must learn. In this dissertation we focus on the agent's adaptation as captured by the reinforcement learning framework. This means learning a policy---a mapping of observations into actions---based on feedback from the environment. The learning can be viewed as browsing a set of policies while evaluating them by trial through interaction with the environment. The set of policies is constrained by the architecture of the agent's controller. POMDPs require a controller to have a memory. We investigate controllers with memory, including controllers with external memory, finite state controllers and distributed controllers for multi-agent systems. For these various controllers we work out the details of the algorithms which learn by ascending the gradient of expected cumulative reinforcement. Building on statistical learning theory and experiment design theory, a policy evaluation algorithm is developed for the case of experience re-use. We address the question of sufficient experience for uniform convergence of policy evaluation and obtain sample complexity bounds for various estimators. Finally, we demonstrate the performance of the proposed algorithms on several domains, the most complex of which is simulated adaptive packet routing in a telecommunication network.

Compositional ideas in the bayesian analysis of categorical data with application to dose finding clinical trials

Compositional random vectors are fundamental tools in the Bayesian analysis of categorical data. Many of the issues that are discussed with reference to the statistical analysis of compositional data have a natural counterpart in the construction of a Bayesian statistical model for categorical data. This note builds on the idea of cross-fertilization of the two areas recommended by Aitchison (1986) in his seminal book on compositional data. Particular emphasis is put on the problem of what parameterization to use

Decision analysis exercises

Exercises and solutions in LaTex

Decision analysis exercises pdf

Exercises and solutions in PDF

Does uncertainty cause inertia in decision making? An experimental study of the role of regret aversion and indecisiveness

Previous research has shown that often there is clear inertia in individual decision making---that is, a tendency for decision makers to choose a status quo option. I conduct a laboratory experiment to investigate two potential determinants of inertia in uncertain environments: (i) regret aversion and (ii) ambiguity-driven indecisiveness. I use a between-subjects design with varying conditions to identify the effects of these two mechanisms on choice behavior. In each condition, participants choose between two simple real gambles, one of which is the status quo option. I find that inertia is quite large and that both mechanisms are equally important.

Risk, ambiguity, and diversification

Attitudes toward risk influence the decision to diversify among uncertain options. Yet, because in most situations the options are ambiguous, attitudes toward ambiguity may also play an important role. I conduct a laboratory experiment to investigate the effect of ambiguity on the decision to diversify. I find that diversification is more prevalent and more persistent under ambiguity than under risk. Moreover, excess diversification under ambiguity is driven by participants who stick with a status quo gamble when diversification among gambles is not feasible. This behavioral pattern cannot be accommodated by major theories of choice under ambiguity.