Page 1 Next

Displaying 1 – 20 of 38

Showing per page

Rangements BBTOPSIS fondés sur des intervalles de proximités relatives avec qualification des préférences

Abdelwaheb Rebaï, Jean-Marc Martel (2010)

RAIRO - Operations Research

In this work we propose a ranking procedure. This procedure uses an ordinal information about the criterion weights and a non-cardinal or mixed information for the potential actions evaluation. The advantage of this procedure is that it uses the linear programming software packages to compute the intervals of relative proximities from where the rankings are obtained.

Rate of convergence for a class of RCA estimators

Pavel Vaněček (2006)

Kybernetika

This work deals with Random Coefficient Autoregressive models where the error process is a martingale difference sequence. A class of estimators of unknown parameter is employed. This class was originally proposed by Schick and it covers both least squares estimator and maximum likelihood estimator for instance. Asymptotic behavior of such estimators is explored, especially the rate of convergence to normal distribution is established.

Rationality of induced ordered weighted operators based on the reliability of the source of information in group decision-making

Francisco Chiclana, Francisco Herrera, Enrique Herrera-Viedma (2004)

Kybernetika

The aggregation of preference relations in group decision-making (GDM) problems can be carried out based on either the reliability of the preference values to be aggregated, as is the case with ordered weighted averaging operators, or on the reliability of the source of information that provided the preferences, as is the case with weighted mean operators. In this paper, we address the problem of aggregation based on the reliability of the source of information, with a double aim: a) To provide...

Rationality principles for preferences on belief functions

Giulianella Coletti, Davide Petturiti, Barbara Vantaggi (2015)

Kybernetika

A generalized notion of lottery is considered, where the uncertainty is expressed by a belief function. Given a partial preference relation on an arbitrary set of generalized lotteries all on the same finite totally ordered set of prizes, conditions for the representability, either by a linear utility or a Choquet expected utility are provided. Both the cases of a finite and an infinite set of generalized lotteries are investigated.

Real-valued conditional convex risk measures in Lp(ℱ, R)

Treviño-Aguilar Erick (2011)

ESAIM: Proceedings

The numerical representation of convex risk measures beyond essentially bounded financial positions is an important topic which has been the theme of recent literature. In other direction, it has been discussed the assessment of essentially bounded risks taking explicitly new information into account, i.e., conditional convex risk measures. In this paper we combine these two lines of research. We discuss the numerical representation of conditional...

Recognition rules in weighted majority games and their implications

Krzysztof Kasprzyk (2006)

Banach Center Publications

This paper examines implications of different random recognition rules used to select proposal-makers on the payoffs of players participating in a weighted majority game. In particular, incentives to strategically alter the set of players by strategic splits or mergers are investigated.

Refracted Lévy processes

A. E. Kyprianou, R. L. Loeffen (2010)

Annales de l'I.H.P. Probabilités et statistiques

Motivated by classical considerations from risk theory, we investigate boundary crossing problems for refracted Lévy processes. The latter is a Lévy process whose dynamics change by subtracting off a fixed linear drift (of suitable size) whenever the aggregate process is above a pre-specified level. More formally, whenever it exists, a refracted Lévy process is described by the unique strong solution to the stochastic differential equation dUt=−δ1{Ut>b} dt+dXt, where X={Xt : t≥0} is a Lévy...

Regles positionnelles iteratives, principe majoritaire et preferences unimodales

Dominique Lepelley, Laurent Vidu (2010)

RAIRO - Operations Research

Sequential scoring rules are multi-stage social choice tules that work as follows: at each stage of the process, a score is computed for each alternative by taking into account its position in the individual preference rankings, and the alternative with the lowest score is eliminated. The current paper studies the ability of these rules for choosing the Condorcet winner (or the strong Condorcet winner) when individual preferences are single-peaked.

Currently displaying 1 – 20 of 38

Page 1 Next