All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 86

Showing per page

Parabolic variational inequalities with generalized reflecting directions

Eduard Rotenstein (2015)

Open Mathematics

We study, in a Hilbert framework, some abstract parabolic variational inequalities, governed by reflecting subgradients with multiplicative perturbation, of the following type: y´(t)+ Ay(t)+0.t Θ(t,y(t)) ∂φ(y(t))∋f(t,y(t)),y(0) = y0,t ∈[0,T] where A is a linear self-adjoint operator, ∂φ is the subdifferential operator of a proper lower semicontinuous convex function φ defined on a suitable Hilbert space, and Θ is the perturbing term which acts on the set of reflecting directions, destroying the...

Parameters in collective decision making models : estimation and sensitivity

Tom A. B. Snijders, Evelien P. H. Zeggelink, Frans N. Stokman (1997)

Mathématiques et Sciences Humaines

Simulation models for collective decision making are based on theoretical and empirical insight in the decision making process, but still contain a number of parameters of which the values are determined ad hoc. For the dynamic access model, some of such parameters are discussed, and it is proposed to extend the utility functions with a random term of which the variance also is an unknown parameter. These parameters can be estimated by fitting model predictions to data, where the predictions can...

Pareto optimality in the kidney exchange problem

Viera Borbeľová, Katarína Cechlárová (2008)

Kybernetika

To overcome the shortage of cadaveric kidneys available for transplantation, several countries organize systematic kidney exchange programs. The kidney exchange problem can be modelled as a cooperative game between incompatible patient-donor pairs whose solutions are permutations of players representing cyclic donations. We show that the problems to decide whether a given permutation is not (weakly) Pareto optimal are NP-complete.

Parrondo's paradox.

Berresford, Geoffrey C., Rockett, Andrew M. (2003)

International Journal of Mathematics and Mathematical Sciences

Partial cooperation and convex sets.

J. Enrique Romero García, Jorge J. López Vázquez (2003)

SORT

We consider games of transferable utility, those that deal with partial cooperation situations, made up of coalition systems, in which every unit coalition is feasible and every coalition of players can be expressed as a disjoint union of maximal feasible coalitions. These systems are named partition systems and cause restricted games. To sum up, we study feasible coalition systems delined by a partial order designed for a set of players and we analyze the characteristics of a feasible coalition...

Performance of hedging strategies in interval models

Berend Roorda, Jacob Engwerda, Johannes M. Schumacher (2005)

Kybernetika

For a proper assessment of risks associated with the trading of derivatives, the performance of hedging strategies should be evaluated not only in the context of the idealized model that has served as the basis of strategy development, but also in the context of other models. In this paper we consider the class of so-called interval models as a possible testing ground. In the context of such models the fair price of a derivative contract is not uniquely determined and we characterize the interval...

Permissive strategies : from parity games to safety games

Julien Bernet, David Janin, Igor Walukiewicz (2002)

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

It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem of finding...

Permissive strategies: from parity games to safety games

Julien Bernet, David Janin, Igor Walukiewicz (2010)

RAIRO - Theoretical Informatics and Applications

It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem...

Currently displaying 1 – 20 of 86

Page 1 Next