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

Previous Page 19 Next

Displaying 361 – 380 of 714

Showing per page

Non-cooperative game approach to multi-robot planning

Adam Gałuszka, Andrzej Świerniak (2005)

International Journal of Applied Mathematics and Computer Science

A multi-robot environment with a STRIPS representation is considered. Under some assumptions such problems can be modelled as a STRIPS language (for instance, a Block World environment) with one initial state and a disjunction of goal states. If the STRIPS planning problem is invertible, then it is possible to apply the machinery for planning in the presence of incomplete information to solve the inverted problem and then to find a solution to the original problem. In the paper a planning algorithm...

Noncooperative games with noncompact joint strategies sets: increasing best responses and approximation to equilibrium points

Rosa María Flores-Hernández, Raúl Montes-de-Oca (2011)

Kybernetika

In this paper conditions proposed in Flores-Hernández and Montes-de-Oca [3] which permit to obtain monotone minimizers of unbounded optimization problems on Euclidean spaces are adapted in suitable versions to study noncooperative games on Euclidean spaces with noncompact sets of feasible joint strategies in order to obtain increasing optimal best responses for each player. Moreover, in this noncompact framework an algorithm to approximate the equilibrium points for noncooperative games is supplied....

Nonzero-sum semi-Markov games with countable state spaces

Wojciech Połowczuk (2000)

Applicationes Mathematicae

We consider nonzero-sum semi-Markov games with a countable state space and compact metric action spaces. We assume that the payoff, mean holding time and transition probability functions are continuous on the action spaces. The main results concern the existence of Nash equilibria for nonzero-sum discounted semi-Markov games and a class of ergodic semi-Markov games with the expected average payoff criterion.

Note On The Game Colouring Number Of Powers Of Graphs

Stephan Dominique Andres, Andrea Theuser (2016)

Discussiones Mathematicae Graph Theory

We generalize the methods of Esperet and Zhu [6] providing an upper bound for the game colouring number of squares of graphs to obtain upper bounds for the game colouring number of m-th powers of graphs, m ≥ 3, which rely on the maximum degree and the game colouring number of the underlying graph. Furthermore, we improve these bounds in case the underlying graph is a forest.

Note: The Smallest Nonevasive Graph Property

Michał Adamaszek (2014)

Discussiones Mathematicae Graph Theory

A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form “is there an edge between vertices u and v” requires, in the worst case, to ask about all pairs of vertices. Most “natural” graph properties are either evasive or conjectured to be such, and of the few examples of nontrivial nonevasive properties scattered in the literature the smallest one has n = 6. We exhibit a nontrivial, nonevasive property of 5-vertex graphs and show that...

Objective function design for robust optimality of linear control under state-constraints and uncertainty

Fabio Bagagiolo, Dario Bauso (2011)

ESAIM: Control, Optimisation and Calculus of Variations

We consider a model for the control of a linear network flow system with unknown but bounded demand and polytopic bounds on controlled flows. We are interested in the problem of finding a suitable objective function that makes robust optimal the policy represented by the so-called linear saturated feedback control. We regard the problem as a suitable differential game with switching cost and study it in the framework of the viscosity solutions theory for Bellman and Isaacs equations.

Objective function design for robust optimality of linear control under state-constraints and uncertainty

Fabio Bagagiolo, Dario Bauso (2011)

ESAIM: Control, Optimisation and Calculus of Variations

We consider a model for the control of a linear network flow system with unknown but bounded demand and polytopic bounds on controlled flows. We are interested in the problem of finding a suitable objective function that makes robust optimal the policy represented by the so-called linear saturated feedback control. We regard the problem as a suitable differential game with switching cost and study it in the framework of the viscosity solutions theory for Bellman and Isaacs equations.

On a dual network exterior point simplex type algorithm and its computational behavior

George Geranis, Konstantinos Paparrizos, Angelo Sifaleras (2012)

RAIRO - Operations Research - Recherche Opérationnelle

The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a solution that is both primal and dual feasible, i.e....

On a dual network exterior point simplex type algorithm and its computational behavior∗

George Geranis, Konstantinos Paparrizos, Angelo Sifaleras (2012)

RAIRO - Operations Research

The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a...

Currently displaying 361 – 380 of 714