Results 11 to 20 of about 28,094 (268)
The State-of-art Applications of Game Theory in Computer Science
Highlights in Science, Engineering and Technology, 2023 From the ancient game theory thought to the increasingly advanced game theory, the concept of game theory has always played an important role in human development. Nowadays, computer technology has become increasingly mature, and there are many applications of game theory among them.
openaire +3 more sources
Theories of Learning: A Computer Game Perspective
, 2003 Computer games provide a good environment for learning. Players learn to play the game without being taught didactically as the learning process takes place naturally in the virtual world.
A.C. Siang +5 more
exaly +2 more sources
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games [PDF]
Logical Methods in Computer Science, 2020 We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible.
Thomas Brihaye +4 more
doaj +1 more source
Games Where You Can Play Optimally with Arena-Independent Finite Memory [PDF]
Logical Methods in Computer Science, 2022 For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious one is controller synthesis, which can be rephrased through the game-theoretic metaphor as the
Patricia Bouyer +4 more
doaj +1 more source
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs [PDF]
TheoretiCS, 2023 We consider zero-sum games on infinite graphs, with objectives specified as sets of infinite words over some alphabet of colors. A well-studied class of objectives is the one of $\omega$-regular objectives, due to its relation to many natural problems in
Patricia Bouyer +2 more
doaj +1 more source
Arena-Independent Finite-Memory Determinacy in Stochastic Games [PDF]
Logical Methods in Computer Science, 2023 We study stochastic zero-sum games on graphs, which are prevalent tools to model decision-making in presence of an antagonistic opponent in a random environment.
Patricia Bouyer +3 more
doaj +1 more source
Good-for-games $\omega$-Pushdown Automata [PDF]
Logical Methods in Computer Science, 2023 We introduce good-for-games $\omega$-pushdown automata ($\omega$-GFG-PDA). These are automata whose nondeterminism can be resolved based on the input processed so far.
Karoliina Lehtinen, Martin Zimmermann
doaj +1 more source
How Much Lookahead is Needed to Win Infinite Games? [PDF]
Logical Methods in Computer Science, 2017 Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent's moves. For $\omega$-regular winning conditions it is known that such games can be solved in doubly-exponential time and ...
Felix Klein, Martin Zimmermann
doaj +1 more source
A theory of Automated Market Makers in DeFi [PDF]
Logical Methods in Computer Science, 2022 Automated market makers (AMMs) are one of the most prominent decentralized finance (DeFi) applications. AMMs allow users to trade different types of crypto-tokens, without the need to find a counter-party. There are several implementations and models for
Massimo Bartoletti +2 more
doaj +1 more source
Optimal controller synthesis for timed systems [PDF]
Logical Methods in Computer Science, 2023 Weighted timed games are zero-sum games played by two players on a timed automaton equipped with weights, where one player wants to minimise the cumulative weight while reaching a target.
Damien Busatto-Gaston +2 more
doaj +1 more source