A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks

Lozovanu Dmitrii; Pickl Stefan Wolfgang

Conţinutul numărului revistei

Articolul precedent

Articolul urmator

SM ISO690:2012

LOZOVANU, Dmitrii, PICKL, Stefan Wolfgang. A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks. In: Electronic Notes in Discrete Mathematics, 2004, vol. 17, pp. 209-214. ISSN 1571-0653. DOI: https://doi.org/10.1016/j.endm.2004.03.041

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Electronic Notes in Discrete Mathematics

Volumul 17 / 2004 / ISSN 1571-0653

A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks

DOI:https://doi.org/10.1016/j.endm.2004.03.041

Pag. 209-214

Lozovanu Dmitrii¹, Pickl Stefan Wolfgang²

¹ Institute of Mathematics and Computer Science ASM,
² University of New Mexico

Disponibil în IBN: 17 ianuarie 2024

Descarcă PDF

Rezumat

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.

Cuvinte-cheie
c-games, network, Polynomial Time-Algorithm

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-194933</cfResPublId>
<cfResPublDate>2004-10-20</cfResPublDate>
<cfStartPage>209</cfStartPage>
<cfISSN>1571-0653</cfISSN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/194933</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks</cfTitle>
<cfKeyw cfLangCode='EN' cfTrans='o'>c-games; network; Polynomial Time-Algorithm</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'><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></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2004-10-20T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2004-10-20T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-129</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2004-10-20T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-14970</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2004-10-20T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfFedId>
<cfFedIdId>ibn-doi-194933</cfFedIdId>
<cfFedId>10.1016/j.endm.2004.03.041</cfFedId>
<cfStartDate>2004-10-20T24:00:00</cfStartDate>
<cfFedId_Class>
<cfClassId>31d222b4-11e0-434b-b5ae-088119c51189</cfClassId>
<cfClassSchemeId>bccb3266-689d-4740-a039-c96594b4d916</cfClassSchemeId>
</cfFedId_Class>
<cfFedId_Srv>
<cfSrvId>5123451</cfSrvId>
<cfClassId>eda2b2e2-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>5a270628-f593-4ff4-a44a-95660c76e182</cfClassSchemeId>
</cfFedId_Srv>
</cfFedId>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-129</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-129-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2004-10-20T24:00:00</cfStartDate>
<cfFamilyNames>Lozovanu</cfFamilyNames>
<cfFirstNames>Dmitrii</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-14970</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-14970-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2004-10-20T24:00:00</cfStartDate>
<cfFamilyNames>Pickl</cfFamilyNames>
<cfFirstNames>Stefan Wolfgang</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfSrv>
<cfSrvId>5123451</cfSrvId>
<cfName cfLangCode='en' cfTrans='o'>CrossRef DOI prefix service</cfName>
<cfDescr cfLangCode='en' cfTrans='o'>The service of issuing DOI prefixes to publishers</cfDescr>
<cfKeyw cfLangCode='en' cfTrans='o'>persistent identifier; Digital Object Identifier</cfKeyw>
</cfSrv>
</CERIF>