DSpace Repository
Methods of solving perfect informational games
Login
DSpace Home
→
Colecția instituțională
→
Conferințe
→
Conference on Applied and Industrial Mathematics - CAIM
→
CAIM - 2018
→
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Methods of solving perfect informational games
HÂNCU, Boris
URI:
http://repository.utm.md/handle/5014/11108
Date:
2018
Abstract:
For any strategies profile (θ1, θ2) it is constructed the normal forms of game on set of informationally nonextended strategies X, Y.
Description:
Only Abstract
Show full item record
Files in this item
Name:
Conf_CAIM_2018_p74.pdf
Size:
292.7Kb
Format:
PDF
View/
Open
The following license files are associated with this item:
Creative Commons
This item appears in the following Collection(s)
CAIM - 2018
20th-23th September, 2018
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States
Search DSpace
Search DSpace
This Collection
Advanced Search
Browse
All of DSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
My Account
Login
Register