<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<identifier identifierType='DOI'>10.1016/j.endm.2004.03.041</identifier>
<creators>
<creator>
<creatorName>Lozovanu, D.D.</creatorName>
<affiliation>Institutul de Matematică şi Informatică al AŞM, Moldova, Republica</affiliation>
</creator>
<creator>
<creatorName>Pickl, S.</creatorName>
<affiliation>University of New Mexico, Statele Unite ale Americii</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2004</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1571-0653</relatedIdentifier>
<subjects>
<subject>c-games</subject>
<subject>network</subject>
<subject>Polynomial Time-Algorithm</subject>
</subjects>
<dates>
<date dateType='Issued'>2004-10-20</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'><p>In this paper we extend the dynamic programming technique for the multiobjective version of a special class of problems representing a graph-theoretic structure on a certain network. We assume that the dynamics of the system is controlled by p actors (players) and each of them intend to minimize his own integral-time cost which is described by a certain trajectory. Applying Nash and Pareto optimality principles we study the multiobjective control problems on dynamic networks where the dynamics is described by a directed graph. Polynomial-time algorithms for determining the optimal strategies of the players in the considered multiobjective control problems are proposed exploiting the special structure of the underlying graph.</p></description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>