Displaying 821 – 840 of 1948

Showing per page

Interpretation and optimization of the k -means algorithm

Kristian Sabo, Rudolf Scitovski (2014)

Applications of Mathematics

The paper gives a new interpretation and a possible optimization of the well-known k -means algorithm for searching for a locally optimal partition of the set 𝒜 = { a i n : i = 1 , , m } which consists of k disjoint nonempty subsets π 1 , , π k , 1 k m . For this purpose, a new divided k -means algorithm was constructed as a limit case of the known smoothed k -means algorithm. It is shown that the algorithm constructed in this way coincides with the k -means algorithm if during the iterative procedure no data points appear in the Voronoi diagram....

Interval valued bimatrix games

Milan Hladík (2010)

Kybernetika

Payoffs in (bimatrix) games are usually not known precisely, but it is often possible to determine lower and upper bounds on payoffs. Such interval valued bimatrix games are considered in this paper. There are many questions arising in this context. First, we discuss the problem of existence of an equilibrium being common for all instances of interval values. We show that this property is equivalent to solvability of a certain linear mixed integer system of equations and inequalities. Second, we...

Introduction to Formal Preference Spaces

Eliza Niewiadomska, Adam Grabowski (2013)

Formalized Mathematics

In the article the formal characterization of preference spaces [1] is given. As the preference relation is one of the very basic notions of mathematical economics [9], it prepares some ground for a more thorough formalization of consumer theory (although some work has already been done - see [17]). There was an attempt to formalize similar results in Mizar, but this work seems still unfinished [18]. There are many approaches to preferences in literature. We modelled them in a rather illustrative...

Juegos con corazón no vacío. Una nueva caracterización.

Inés Sobrón Fernández (1991)

Trabajos de Investigación Operativa

Se introducen las definiciones usuales sobre teoría de juegos cooperativos, dándose la caracterización de Bondareva-Shapley para juegos con corazón no vacío. Se obtiene una caracterización para esta última clase de juegos, partiendo del concepto de función supermodular.

Juegos estocásticos continuos: valor y estrategias óptimas.

M.ª Angeles Muruaga, Ricardo Vélez (1992)

Trabajos de Investigación Operativa

El objeto de este trabajo es analizar los juegos estocásticos cuyo espacio de estados y de acciones son métricos compactos, con adecuadas condiciones de continuidad acerca de las funciones de pago y de transición. Tras describir el modelo e introducir las hipótesis de continuidad, se trata el problema con horizonte finito, a fin de probar que existe valor y estrategias óptimas para ambos jugadores, que puedan ser determinados recurrentemente. También se considera el caso de horizonte infinito en...

Currently displaying 821 – 840 of 1948