Entropy Games and Matrix Multiplication Games
| Autor: | Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor Kozyakin |
|---|---|
| Přispěvatelé: | Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Algorithmique Complexité et Logique (LACL), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12)-Centre National de la Recherche Scientifique (CNRS), Institute for Information Transmission Problems (IITP), Russian Academy of Sciences [Moscow] (RAS), ANR-11-BS02-004 - EQINOCS and Russian Science Foundation (project 14-50-00150)., ANR-11-BS02-0004,EQINOCS,Entropie et quantité d'information dans les modèles des systèmes computationnels(2011) |
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: |
FOS: Computer and information sciences
game theory 0209 industrial biotechnology 000 Computer science knowledge general works [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT] Computer Science - Information Theory Information Theory (cs.IT) [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] ComputingMilieux_PERSONALCOMPUTING 010103 numerical & computational mathematics 02 engineering and technology 01 natural sciences joint spectral radius 020901 industrial engineering & automation Computer Science - Computer Science and Game Theory [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT] Computer Science 0101 mathematics entropy Computer Science and Game Theory (cs.GT) |
| Zdroj: | HAL |
| Popis: | Two intimately related new classes of games are introduced and studied: entropy games (EGs) and matrix multiplication games (MMGs). An EG is played on a finite arena by two-and-a-half players: Despot, Tribune and the non-deterministic People. Despot wants to make the set of possible People's behaviors as small as possible, while Tribune wants to make it as large as possible.An MMG is played by two players that alternately write matrices from some predefined finite sets. One wants to maximize the growth rate of the product, and the other to minimize it. We show that in general MMGs are undecidable in quite a strong sense.On the positive side, EGs correspond to a subclass of MMGs, and we prove that such MMGs and EGs are determined, and that the optimal strategies are simple. The complexity of solving such games is in NP\&coNP. Accepted to STACS 2016 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|