|
|
Probabilistic semantics for Independence-friendly Logics
Seidl, Julian ; Majer, Ondrej (advisor) ; Švarný, Petr (referee)
(in English): Character of the work is purely theoretical and it pursues game theory in the perspective of mathematical logic and probability. The work is divided into two parts. Introductory part compiles basic concepts and definitions, summarizing the game theory and basics of syntax and semantics of mathematical logic and its extensions suitable for work in the field of game theory. Introductory part also explains following terms: extensive and strategic form of games, Nash equilibrium, pure and mixed strategies, winning strategies or independence-friendly logic. The problems solved in the second part of the work such as question of existence of Nash equilibrium in the games with infinite models or issue which arises when trying to uniformly distribute the probability of strategies in the same class of games are sketched out. The second part continues with analysis of strategic games with imperfect information aiming to the solution of nontrivial problems earlier proposed. Second part also introduces basic concepts and definitions of the probability theory, which helps comprehending the problems mentioned above. The last part of the work before the very presentation of some results induced by the area of infinite games is conversion between strategic and extensive games form. In the end of the...
|
|
|
Multiplatform Card Game with Artificial Intelligence
Trejtnar, Martin ; Chlubna, Tomáš (referee) ; Matýšek, Michal (advisor)
This thesis focuses on artificial intelligence in card games. The goal is to implement a multi-platform game of this genre in the Unity game engine, to summarize possible approaches that are being used in order to create intelligent agents and furthermore to design and describe the most suitable method or combination of methods for the chosen game. The research that was carried out has shown that the problem domain of card games is rather specific, making it more difficult to use the general-purpose algorithms. The problem given was solved using the rule-based artificial intelligence. The intelligent agent has been implemented for a game of imperfect information, which is considered to be the main contribution of this work to the community. Even though the artificial intelligence player is making minor tactical mistakes, his behavior closely resembles the way of thinking of semi-experienced players.
|
|
|
Market model with random inputs
Krch, Ivan ; Lachout, Petr (advisor) ; Branda, Martin (referee)
The thesis deals with market models with random inputs represented by the newsvendor problem for which the randomness is given through a random number of customers. Presented work is divided into three chapters. In the first chapter we present the elementar newsvendor problem as stochastic programming problem with a fixed recourse. In the second chapter we present the multiplayer game theory adapted to the newsvendors problem. Moreover, in the second chapter we extend the problem by the second newsvendor on the market and in the third chapter we generalize the problem for n newsvendors on the market. We deal with the situations that arise in the chapters two and three from the game theory point of view and we study characteristics of a Nash equilibrium. Presented theory is demonstrated on illustrative examples in the ends of the two last chapters. 1
|
|
|
Market model with random inputs
Krch, Ivan ; Lachout, Petr (advisor) ; Večeř, Jan (referee)
The thesis deals with market models with random inputs represented by the newsvendor problem for which the randomness is given through a random number of customers. Presented work is divided into three chapters. In the first chapter we present the elementar newsvendor problem as stochastic programming problem with a fixed recourse. In the second chapter we present the multiplayer game theory adapted to the newsvendors problem. Moreover, in the second chapter we extend the problem by the second newsvendor on the market and in the third chapter we generalize the problem for n newsvendors on the market. We deal with the situations that arise in the chapters two and three from the game theory point of view and we study characteristics of a Nash equilibrium. Presented theory is demonstrated on illustrative examples in the ends of the two last chapters. 1
|
|
|
Market of newsboys
Bureček, Tomáš ; Lachout, Petr (advisor) ; Kopa, Miloš (referee)
This thesis solves the task of a newspaper vendor, which fits into the classical tasks of stochastic programming. The work includes an extension to the market of newsboys and also considers various influences that vendors may suffer. A continuous version of the problem is considered. The task is to find the optimal amount of product the buyer can buy to maximize his yield. The thesis discusses the issue of solving this problem. First, the problem is demonstrated in a easier version, and later this problem is developed. Finally, we find an iterative algorithm that calculates the approximate solution and demonstrates its functionality on an example. 1
|
|
|
Algorithmic complexity of solution concepts in selected classes of non-cooperative games
Wichera, Adam ; Majer, Ondřej (advisor) ; Kroupa, Tomáš (referee)
Title: Algorithmic complexity of solution concepts in selected classes of non-cooperative games Author: Adam Wichera Department: Department of Logic Supervisor: RNDr. Ondřej Majer, CSc. Supervisor's e-mail address: majer@ u.cas.cz Abstract In the presented work we study natural algorthmic problems rising from the concept of Nash Equilibrium. The problem of it's existence is trivial, because it follows from Nash The- orem of completeness of Nash Equilibria. Even related search problem doesn't seem to belong to NP-complete class, the reason being the very fact, that existence of Nash Equilibria is certain. Interesting observation is that every natural extension of this problem seems to be NP-complete. Many of such problems have been proven to be NP-complete through reduction of SAT problem, Klike problem or problem of searching subcover of certain size. The question, wheather the pro- blem of existence of assymmetric Nash equilibria of symmeric game ts with the others, in being NP-complete, has been an open problem. Here we show how to alternate the proof from [? ] and apply the construction to problem of existence of assymetric equilibria and therefore prove its NP-completness. Keywords: Nash equilibrium, Algorithmic complexity, Non-cooperative games, Game Theory, Assymetric equilibria, 1
|
|
|
Solving Endgames in Large Imperfect-Information Games such as Poker
Ha, Karel ; Hladík, Milan (advisor) ; Bošanský, Branislav (referee)
Title: Solving Endgames in Large Imperfect-Information Games such as Poker Author: Bc. Karel Ha Department: Department of Applied Mathematics Supervisor: doc. Mgr. Milan Hladík, Ph.D., Department of Applied Mathematics Abstract: Endgames have a distinctive role for players. At the late stage of games, many aspects are finally clearly defined, deeming exhaustive analysis tractable. Specialised endgame handling is rewarding for games with perfect information (e.g., Chess databases pre-computed for entire classes of endings, or dividing Go board into separate independent subgames). An appealing idea would be to extend this approach to imperfect-information games such as the famous Poker: play the early parts of the game, and once the subgame becomes feasible, calculate an ending solution. However, the problem is much more complex for imperfect information. Subgames need to be generalized to account for information sets. Unfortunately, such a generalization cannot be solved straightaway, as it does not generally preserve optimality. As a consequence, we may end up with a far more exploitable strategy. There are currently three techniques to deal with this challenge: (a) disregard the problem entirely; (b) use a decomposition technique, which sadly retains only the same quality; (c) or formalize improvements of...
|
|
|
Spatial agent-based models of common pool resources
Vach, Dominik ; Gregor, Martin (advisor) ; Červinka, Michal (referee)
This thesis examines the application of the spatial aspect applied in the com- petitive models in the context of the natural resource economics. At first, the spatial models are thoroughly derived in one dimension. Then also their general properties such as the choice of the agents' location or their payoff function are examined. These properties are investigated for various distri- butions of the resource, and therefore they depend also on their parameters. The Nash equilibrium and local stability conditions are derived for the basic setups. In the second part, these competitive models are numerically tested also in a two-dimensional space. One of the results also suggests, that in the setup where the players have perfect information, the beginning player is not necessarily always better off than the second player. Throughout the entire thesis it is also comprehensively examined whether the existence of corners of the strategy space has an impact on the existence of the competition which was successfully demonstrated on several cases. JEL Classification Q20, Q22, C62, C68, C72 Keywords spatial models, natural resource exploitation, Nash equilibrium, fishery, computer simulations Author's e-mail vach.dominik@gmail.com Supervisor's e-mail martin.gregor@fsv.cuni.cz 1
|
|
|
(Non)rationality of betting
Hamáček, Filip ; Hlaváček, Jiří (advisor) ; Cahlík, Tomáš (referee)
The subject of this bachelors thesis is nonrationality of betting. The first part of thesis is discussing different instruments of risk evaluation. The second part is about Petersburg paradox. This thesis tries to find alternative solution to Petersburg paradox using two methods, the first method is based on repeating high amount of petersburg games. The second method is maximizing the probability of economic survival, which is based on wealth of the player and on bound of economic survival. In the third part of this thesis, Sportka (Czech lottery) is compared with special tournament of poker. The goal of this part is to compare the expected return of investment on playing Sportka and on playing poker without even basic notion about rules and the game strategy. For the estimation of the expected value of poker tournament, different game scenarios are considered, probability of scenarios are based on players behavior according to the Nash equilibrium. Keywords: Betting, expected value, Petersburg paradox, lottery, poker, Nash equilibrium
|
|
|
Evaluating public state space abstractions in extensive form games with an application in poker
Moravčík, Matej ; Hladík, Milan (advisor) ; Zimmermann, Karel (referee)
Efficient algorithms exist for finding optimal strategies in extensive-form games. However human scale problems, such as poker, are typically so large that computation of these strategies remain infeasible with current technology. State space abstraction techniques allow us to derive a smaller abstract game, in which an optimal strategy can be computed and then used in the real game. This thesis introduces state of the art abstraction techniques. Most of these techniques do not deal with public information. We present a new automatic public state space abstraction technique. We examine the quality of this technique in the domain of poker. Our experimental results show that the new technique brings significant performance improvement. Powered by TCPDF (www.tcpdf.org)
|
guest ::
