Buscar
Mostrando ítems 261-270 de 335
Ponencia
Note on the number of obtuse angles in point sets
(2013)
In 1979 Conway, Croft, Erd\H{o}s and Guy proved that every set SS of nn points in general position in the plane determines at least n3/18−O(n2) obtuse angles and also presented a special set of nn points to show the upper ...
Tesis Doctoral
Artículo
A Value for Games Restricted by Augmenting Systems
(Society for Industrial and Applied Mathematics, 2010)
This paper deals with cooperative games in which only certain coalitions are allowed to form. There have been previous models developed to confront the problem of nonfeasible coalitions. Games restricted by a communication ...
Artículo
Soft cooperation systems and games
(Taylor and Francis, 2018-04)
A cooperative game for a set of agents establishes a fair allocation of the profit obtained for their cooperation. In order to obtain this allocation, a characteristic function is known. It establishes the profit of each ...
Artículo
Separability, Boxicity, and Partial Orders
(Springer, 2023)
A collection S = {Si,..., Sn} of disjoint closed convex sets in Rd is separable if there exists a direction (a non-zero vector) −→v of Rd such that the elements of S can be removed, one at a time, by translating them an ...
Ponencia
Guarding the vertices of thin orthogonal polygons is NP-hard
(2013)
An orthogonal polygon of P is called “thin” if the dual graph of the partition obtained by extending all edges of P towards its interior until they hit the boundary is a tree. We show that the problem of computing a minimum ...
Tesis Doctoral
Conceptos de solución para juegos sobre espacios de clausura
(1998)
"En esta memoria de investigación se estudian juegos definidos sobre familias de conjuntos, las cuales representan las colecciones de coaliciones factibles en un juego. Se definen distintos conceptos de solución para estos ...
Artículo
Enseñar con mathematica
(Universidad de Sevilla, 1994)
Artículo
An application of the Shapley value to the analysis of co-expression networks
(Springer Nature, 2018-08-24)
We study the problem of identifying relevant genes in a co-expression network using a (cooperative) game theoretic approach. The Shapley value of a cooperative game is used to asses the relevance of each gene in interaction ...
Ponencia
Distance domination, guarding and vertex cover for maximal outerplanar graphs
(2013)
In this paper we de ne a distance guarding concept on plane graphs and associate this concept with distance domination and distance vertex cover concepts on triangulation graphs. Furthermore, for any n-vertex maximal ...