Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Valeriu UNGUREANU"'
Autor:
Valeriu Ungureanu
Publikováno v:
Computer Science Journal of Moldova, Vol 25, Iss 1(73), Pp 3-20 (2017)
Dyadic two-person mixed strategy games form the case for which Nash equilibrium sets can be determined simply. In this paper the set of Nash equilibria in a particular game is determined as an intersection of graphs of optimal reaction mappings of th
Externí odkaz:
https://doaj.org/article/d3f19f72540c4585b396003dcad06f73
Autor:
Valeriu Ungureanu
Publikováno v:
Computer Science Journal of Moldova, Vol 24, Iss 1(70), Pp 83-105 (2016)
We consider pseudo-simultaneous normal form games - strategic games with rules violated by information leaks and simultaneity corruption. We provide classification and construction of a game taxonomy based on applicable solution principles. Existence
Externí odkaz:
https://doaj.org/article/3be2a1511d064d7797a517680717c445
Autor:
Victoria Lozan, Valeriu Ungureanu
Publikováno v:
Computer Science Journal of Moldova, Vol 21, Iss 2(62), Pp 174-203 (2013)
The Pareto-Nash equilibrium set (PNES) is described as intersection of graphs of efficient response mappings. The problem of PNES computing in finite multi-objective mixed-strategy games (Pareto-Nash games) is considered. A method for PNES computing
Externí odkaz:
https://doaj.org/article/2cc0cb4bae8842099b72c7f4f708d956
Autor:
Valeriu Ungureanu
Publikováno v:
Computer Science Journal of Moldova, Vol 21, Iss 1(61), Pp 65-85 (2013)
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 star
Externí odkaz:
https://doaj.org/article/dff9e8815a434fd9bac111c07a4f0bf9
Autor:
Victoria Lozan, Valeriu Ungureanu
Publikováno v:
Computer Science Journal of Moldova, Vol 20, Iss 1(58), Pp 3-15 (2012)
The paper investigates the notion of Pareto-Nash equilibrium as continuation of the works [2--4]. Problems and basic theoretical results are exposed. Method of intersection of graphs of best response mappings [3] is applied to solve the dyadic two-cr
Externí odkaz:
https://doaj.org/article/529ffe3669424a5fa77a4d2c282df71a
Autor:
Valeriu Ungureanu
Publikováno v:
Computer Science Journal of Moldova, Vol 14, Iss 3(42), Pp 345-365 (2006)
he Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A method for NES computing is studied. Mathematics Subject Classification 20
Externí odkaz:
https://doaj.org/article/b26f8d6e08034dc2944503890cd196ea
Autor:
Valeriu Ungureanu
Publikováno v:
Computer Science Journal of Moldova, Vol 14, Iss 2(41), Pp 202-206 (2006)
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined – a synthesis of classical TSP and classical Transportation Problem. Algorithms based on Integer Pr
Externí odkaz:
https://doaj.org/article/58845f2fef0343329104348b604ccd60
Autor:
Valeriu Ungureanu, Ana Botnari
Publikováno v:
Computer Science Journal of Moldova, Vol 13, Iss 2(38), Pp 136-150 (2005)
We describe the Nash equilibria set as an intersection of best response graphs. The problem of Nash equilibria set construction for \hbox{two-person} mixed extended 2x3 games is studied. Mathematics Subject Classification 2000:91A05, 91A06, 91A10,
Externí odkaz:
https://doaj.org/article/7b14097b96444a56a8fbaa9e70551e4d
Autor:
Valeriu Ungureanu, Ana Botnari
Publikováno v:
Computer Science Journal of Moldova, Vol 13, Iss 1(37), Pp 13-28 (2005)
We describe the Nash equilibria set as an intersection of graphs of players' best responses. The problem of Nash equilibria set construction for three-person extended 2 2 2 games is studied. Mathematics Subject Classification 2000: 90C05, 90C10, 90C2
Externí odkaz:
https://doaj.org/article/47c36bc258df4cfba254d14fe3610201
Autor:
Tatiana Pașa, Valeriu Ungureanu
Publikováno v:
Review of the Air Force Academy. 15:49-56