DSpace Repository

Methods of solving perfect informational games

Show simple item record

dc.contributor.author HÂNCU, Boris
dc.date.accessioned 2020-11-05T09:50:34Z
dc.date.available 2020-11-05T09:50:34Z
dc.date.issued 2018
dc.identifier.citation HÂNCU, Boris. Methods of solving perfect informational games. In: CAIM 2018: The 26th Conference on Applied and Industrial Mathematics: Book of Abstracts, Technical University of Moldova, September 20-23, 2018. Chişinău: Bons Offices, 2018, p. 74. en_US
dc.identifier.uri http://repository.utm.md/handle/5014/11108
dc.description Only Abstract en_US
dc.description.abstract For any strategies profile (θ1, θ2) it is constructed the normal forms of game on set of informationally nonextended strategies X, Y. en_US
dc.language.iso en en_US
dc.publisher Bons Offices en_US
dc.rights Attribution-NonCommercial-NoDerivs 3.0 United States *
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/us/ *
dc.subject perfect informational games en_US
dc.subject players en_US
dc.subject strategies en_US
dc.subject functions en_US
dc.subject solutions en_US
dc.title Methods of solving perfect informational games en_US
dc.type Article en_US


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States

Search DSpace


Advanced Search

Browse

My Account