Displaying 1421 – 1440 of 1943

Showing per page

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.

Recursive algorithm for parity games requires exponential time

Oliver Friedmann (2011)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.

Recursive algorithm for parity games requires exponential time

Oliver Friedmann (2012)

RAIRO - Theoretical Informatics and Applications

This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.

Currently displaying 1421 – 1440 of 1943