Displaying 781 – 800 of 1948

Showing per page

Hiérarchies conceptuelles de données binaires

Alain Guénoche (1993)

Mathématiques et Sciences Humaines

En classification conceptuelle d'un ensemble d'objets décrits dans un espace de représentation, on cherche à construire une partition des objets en classes disjointes et simultanément une caractérisation de chaque classe dans les termes de l'espace de représentation. Dans le cas, très courant, où cet espace est engendré par des données binaires nous présentons deux algorithmes, dérivés des méthodes ascendantes et descendantes en classification qui maximisent localement un indice de cohésion des...

How Long Can One Bluff in the Domination Game?

Boštan Brešar, Paul Dorbec, Sandi Klavžar, Gašpar Košmrlj (2017)

Discussiones Mathematicae Graph Theory

The domination game is played on an arbitrary graph G by two players, Dominator and Staller. The game is called Game 1 when Dominator starts it, and Game 2 otherwise. In this paper bluff graphs are introduced as the graphs in which every vertex is an optimal start vertex in Game 1 as well as in Game 2. It is proved that every minus graph (a graph in which Game 2 finishes faster than Game 1) is a bluff graph. A non-trivial infinite family of minus (and hence bluff) graphs is established. minus graphs...

How to state necessary optimality conditions for control problems with deviating arguments?

Lassana Samassi, Rabah Tahraoui (2008)

ESAIM: Control, Optimisation and Calculus of Variations

The aim of this paper is to give a general idea to state optimality conditions of control problems in the following form: inf ( u , v ) 𝒰 a d 0 1 f t , u ( θ v ( t ) ) , u ' ( t ) , v ( t ) d t , (1) where 𝒰 a d is a set of admissible controls and θ v is the solution of the following equation: { d θ ( t ) d t = g ( t , θ ( t ) , v ( t ) ) , t [ 0 , 1 ] ; θ ( 0 ) = θ 0 , θ ( t ) [ 0 , 1 ] t . (2). The results are nonlocal and new.

Incomplete information and risk sensitive analysis of sequential games without a predetermined order of turns

Rubén Becerril-Borja, Raúl Montes-de-Oca (2021)

Kybernetika

The authors introduce risk sensitivity to a model of sequential games where players don't know beforehand which of them will make a choice at each stage of the game. It is shown that every sequential game without a predetermined order of turns with risk sensitivity has a Nash equilibrium, as well as in the case in which players have types that are chosen for them before the game starts and that are kept from the other players. There are also a couple of examples that show how the equilibria might...

Incompleteness of the bond market with Lévy noise under the physical measure

Michał Barski (2015)

Banach Center Publications

The problem of completeness of the forward rate based bond market model driven by a Lévy process under the physical measure is examined. The incompleteness of market in the case when the Lévy measure has a density function is shown. The required elements of the theory of stochastic integration over the compensated jump measure under a martingale measure are presented and the corresponding integral representation of local martingales is proven.

Indices económicos. Modelo dinámico de inversión.

M.ª Angeles Fernández Fernández (1986)

Trabajos de Investigación Operativa

Se estudia el problema de inversión en un mercado en donde las rentabilidades aleatorias de los títulos satisfacen una relación temporal con rentabilidades anteriores y las interrelaciones vendrán dadas a través de unos índices, uno común a todos los títulos y otro específico del sector en que pueda incluirse cada título.

Currently displaying 781 – 800 of 1948