MATRIX GAME WITH THE PREFERENCE CHANGING IN TIME

Guram N. Beltadze ()
Additional contact information
Guram N. Beltadze: Department of Control Systems, Georgian Technical University, 77, M. Kostava St., Tbilisi 0175, Georgia

Management Research and Practice, 2010, vol. 2, issue 2, 179-190

Abstract: In this paper matrix game is defined, which elements are the functions of one argument differentiated for any kind of row in the [0, 1] interval. The following cases are discussed: 1). The functions are the polynomials not more of m-1 degree; 2). The functions are more common and have every kind of row uninterrupted derived in any positive interval For these matrix games the solutions (or saddle points) are defined in the positive interval in the pure and mixed strategies. The questions of their existence are taken from the existence the solutions in the lexicographic matrix games m-measuring vectorial payoffs in the first case, during the unlimited measuring vectorial payoffs in the second case.

Keywords: matrix game; lexicographic game; solution. (search for similar items in EconPapers)
JEL-codes: C70 (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
https://mrp.ase.ro/no22/f4.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:rom:mrpase:v:2:y:2010:i:2:p:179-190

Access Statistics for this article

Management Research and Practice is currently edited by Colesca Sofia

More articles in Management Research and Practice from Research Centre in Public Administration and Public Services, Bucharest, Romania Contact information at EDIRC.
Bibliographic data for series maintained by Colesca Sofia ().