Succinct Game

High Quality Content by WIKIPEDIA articles! In algorithmic game theory, a succinct game or a succinctly representable game is a game which may be represented in a size much smaller than its normal form representation. Without placing constraints on player utilities, describing a game of players, each facing strategies, requires listing utility values. Even trivial algorithms are capable of finding a Nash equilibrium in a time polynomial in the length of such a large input. A succinct game is of polynomial type if in a game represented by a string of length n the number of players, as well as the number of strategies of each player, is bounded by a polynomial in n (a formal definition, describing succinct games as a computational problem, is given by Papadimitriou & Roughgarden 2008). Dannoe izdanie predstavlyaet soboj kompilyatsiyu svedenij, nahodyaschihsya v svobodnom dostupe v srede Internet v tselom, i v informatsionnom setevom resurse "Vikipediya" v chastnosti. Sobrannaya po chastotnym zaprosam ukazannoj tematiki, dannaya kompilyatsiya postroena po printsipu podbora blizkih informatsionnyh ssylok, ne imeet samostoyatelnogo syuzheta, ne soderzhit nikakih analiticheskih materialov, vyvodov, otsenok moralnogo, eticheskogo, politicheskogo, religioznogo i mirovozzrencheskogo haraktera v otnoshenii glavnoj tematiki, predstavlyaya soboj isklyuchitelno faktologicheskij material. This book was created using print-on-demand technology.