Sökning: "algorithmic game theory"

Hittade 3 uppsatser innehållade orden algorithmic game theory.

1. 1. Stratego Using Deep Reinforcement Learning and Search

   Master-uppsats, KTH/Matematisk statistik

   Författare :Anton Falk; [2021]
   Nyckelord :;

   Sammanfattning : Algorithmic game theory is a research area concerned with developing algorithms for solving games using game-theoretic concepts, with many applications in areas where games are used as models to achieve knowledge. In the last decades, numerous game-playing bots have been created, and in many games, they outperform top humans. LÄS MER

3. 2. Knowledge-Based Expansions for Strategy Synthesis in Discrete Games on Graphs

   Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Axel Janson; Marc Du Rietz; [2020]
   Nyckelord :Game Theory; Multiplayer; Imperfect Informa-tion; Knowledge; Strategy Synthesis;

   Sammanfattning :  When analyzing situations involving intelligent agents with objectives, it can be helpful to use discrete games as models. Within such game models the synthesis of winning strategies is of interest, and many algorithmic methods have been developed for this purpose. LÄS MER

4. 3. Cluster Analysis from a Game Theoretical Framework

   D-uppsats, Handelshögskolan i Stockholm/Institutionen för nationalekonomi

   Författare :Rachael Ahn; [2018]
   Nyckelord :cluster analysis; algorithmic game theory; Nash equilibrium; repeated games;

   Sammanfattning : Although regression analysis is the predominant method of statistical analysis in econometrics, unsupervised methods such as cluster analysis can bring novel insight into detailed data sets. In this paper, we analogize game theory with cluster analysis, and find that the k-means algorithm is a Nash equilibrium in a repeated game framework. LÄS MER