Linear discrete-time Pareto-Nash-Stackelberg control problem and principles for its solving

A direct-straightforward method for solving linear discrete-time optimal control problem is applied to solve control problem of a linear discrete-time system as a mixture of multi-criteria Stackelberg and Nash games. For simplicity, the exposure starts with the simplest case of linear discrete-time...

Full description

Saved in:
Bibliographic Details
Published inComputer science journal of Moldova Vol. 21; no. 1(61); pp. 65 - 85
Main Author Valeriu Ungureanu
Format Journal Article
LanguageEnglish
Published Vladimir Andrunachievici Institute of Mathematics and Computer Science 01.04.2013
Subjects
Linear discrete-time control problem
multi-criteria strategic game
non-cooperative game
Pareto-Nash-Stackelberg control
Online AccessGet full text
ISSN1561-4042

Cover

Abstract A direct-straightforward method for solving linear discrete-time optimal control problem is applied to solve control problem of a linear discrete-time system as a mixture of multi-criteria Stackelberg and Nash games. For simplicity, the exposure starts with the simplest case of linear discrete-time optimal control problem and, by sequential considering of more general cases, investigation finalizes with the highlighted Pareto-Nash-Stackelberg and set valued control problems. Different principles of solving are compared and their equivalence is proved. Mathematics Subject Classification 2010: 49K21, 49N05, 93C05, 93C55, 90C05, 90C29, 91A10, 91A20, 91A44, 91A50.
AbstractList A direct-straightforward method for solving linear discrete-time optimal control problem is applied to solve control problem of a linear discrete-time system as a mixture of multi-criteria Stackelberg and Nash games. For simplicity, the exposure starts with the simplest case of linear discrete-time optimal control problem and, by sequential considering of more general cases, investigation finalizes with the highlighted Pareto-Nash-Stackelberg and set valued control problems. Different principles of solving are compared and their equivalence is proved. Mathematics Subject Classification 2010: 49K21, 49N05, 93C05, 93C55, 90C05, 90C29, 91A10, 91A20, 91A44, 91A50.
Author Valeriu Ungureanu
Author_xml – sequence: 1
  fullname: Valeriu Ungureanu
  organization: State University of Moldova, 60, A. Mateevici str., Chisinau, MD-2009, Moldova
BookMark eNotjs1KAzEURmdRwbb6DnmBQDKTmUyWUvwpFBXUlYvh5uampqaTkgTBt7eoq3M4i49v1SzmNNOiWcp-kFwJ1V42q1IOQgyDGttl874LM0FmLhTMVInXcCT2DGdP_BHKB3-pgJ8ULeU9wzTXnCI75WQjHRnM7uxhxnCKVJhPmYVaWEnxK8z7q-bCQyx0_c9183Z3-7p54Lun--3mZsed7GXlgzNaK-x8S1a4Tg4olVNoqAVC8NBLO1LnO3TaeELd9gaF0mYY0Fmvdbdutn-7LsFhOv85Qv6eEoTpN6S8nyDXgJEm572hcZQ9qE55ZyyglBKFBuWF9ab7AQXfXxY
ContentType Journal Article
DBID DOA
DatabaseName DOAJ Directory of Open Access Journals
DatabaseTitleList
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 85
ExternalDocumentID oai_doaj_org_article_dff9e8815a434fd9bac111c07a4f0bf9
GroupedDBID 29F
2WC
5VS
AAKPC
ABDBF
ACIPV
ACUHS
ADBBV
AEGXH
ALMA_UNASSIGNED_HOLDINGS
AMVHM
BCNDV
EOJEC
ESX
GROUPED_DOAJ
KQ8
MK~
ML~
OBODZ
OK1
OVT
RNS
TR2
TUS
ID FETCH-LOGICAL-d151t-6d9774c3f2eb0d316c14d4c9e2aecafa51b8e3f3cd79fec7259c047966cdbf773
IEDL.DBID DOA
ISSN 1561-4042
IngestDate Fri Oct 03 12:45:31 EDT 2025
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1(61)
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-d151t-6d9774c3f2eb0d316c14d4c9e2aecafa51b8e3f3cd79fec7259c047966cdbf773
OpenAccessLink https://doaj.org/article/dff9e8815a434fd9bac111c07a4f0bf9
PageCount 21
ParticipantIDs doaj_primary_oai_doaj_org_article_dff9e8815a434fd9bac111c07a4f0bf9
PublicationCentury 2000
PublicationDate 2013-04-01
PublicationDateYYYYMMDD 2013-04-01
PublicationDate_xml – month: 04
  year: 2013
  text: 2013-04-01
  day: 01
PublicationDecade 2010
PublicationTitle Computer science journal of Moldova
PublicationYear 2013
Publisher Vladimir Andrunachievici Institute of Mathematics and Computer Science
Publisher_xml – name: Vladimir Andrunachievici Institute of Mathematics and Computer Science
SSID ssj0066482
Score 1.8955832
Snippet A direct-straightforward method for solving linear discrete-time optimal control problem is applied to solve control problem of a linear discrete-time system...
SourceID doaj
SourceType Open Website
StartPage 65
SubjectTerms Linear discrete-time control problem
multi-criteria strategic game
non-cooperative game
Pareto-Nash-Stackelberg control
Title Linear discrete-time Pareto-Nash-Stackelberg control problem and principles for its solving
URI https://doaj.org/article/dff9e8815a434fd9bac111c07a4f0bf9
Volume 21
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAFT
  databaseName: Open Access Digital Library
  issn: 1561-4042
  databaseCode: KQ8
  dateStart: 19930101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  omitProxy: true
  ssIdentifier: ssj0066482
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVEBS
  databaseName: EBSCO Academic Search Ultimate
  issn: 1561-4042
  databaseCode: ABDBF
  dateStart: 20090501
  customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn
  omitProxy: true
  ssIdentifier: ssj0066482
  providerName: EBSCOhost
– providerCode: PRVEBS
  databaseName: EBSCOhost Mathematics Source - HOST
  issn: 1561-4042
  databaseCode: AMVHM
  dateStart: 20090501
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.ebsco.com/products/research-databases/mathematics-source
  omitProxy: false
  ssIdentifier: ssj0066482
  providerName: EBSCOhost
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09a8MwEBWlXbr0u_QzaOgqaluKZI1J2xAKDR0aCHQw-jraxQmJ-_97ZzuQrUtXg23Q6XTvibv3GHswUZYRkTGSnJgJPP2CKCOAkIW03iuDNZdmh99mejpXr4vhYsfqi3rCOnngbuEe8UWbyjIfOiUVROtdwPQMmXEKMg_t6F5W2i2Z6s5grVVrE4XkhBgS-bDvKPK3pWNywo56zMdH3b9O2V6qz9jx1k-B9-l1zj6RGOLG4zQpu0YwK8j4nb-TD-1SzNzmSyA0xKxrZal432TOe0sY7urIV9ur8w1HMMq_mw3HvUV3BhdsPnn5eJqK3vxARCzCjdCRkFmQUCSfRZnrkKuogk2FS8GBG-a-TBJkiMZCCgZpTCC5eK1D9GCMvGT79bJOV4z7woFUAWQMSeVgvMKsdiola4FCdM3GtDjVqtO3qEhxun2Acaj6OFR_xeHmPz5yyw6L1m6COmPu2H6z_kn3WPQbP2AHo_HzeDJo4_wLnSOyEw
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Linear+discrete-time+Pareto-Nash-Stackelberg+control+problem+and+principles+for+its+solving&rft.jtitle=Computer+science+journal+of+Moldova&rft.au=Valeriu+Ungureanu&rft.date=2013-04-01&rft.pub=Vladimir+Andrunachievici+Institute+of+Mathematics+and+Computer+Science&rft.issn=1561-4042&rft.volume=21&rft.issue=1%2861%29&rft.spage=65&rft.epage=85&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_dff9e8815a434fd9bac111c07a4f0bf9
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1561-4042&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1561-4042&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1561-4042&client=summon