Filters








161,689 Hits in 10.9 sec

When Can Limited Randomness Be Used in Repeated Games? [article]

Pavel Hubáček, Moni Naor, Jonathan Ullman
2015 arXiv   pre-print
When the players are assumed to be computationally bounded, if cryptographic pseudorandom generators (or, equivalently, one-way functions) exist, then the players can base their strategies on "random-like  ...  In this work, we ask whether randomness is necessary for equilibria to exist in finitely repeated games.  ...  In the setting of repeated games, the random string used by the opponent's strategy can be thought of as the secret state.  ... 
arXiv:1507.01191v1 fatcat:ntz7qymgwzbt3bizppm5k6hckq

When Can Limited Randomness Be Used in Repeated Games?

Pavel Hubáček, Moni Naor, Jonathan Ullman
2016 Theory of Computing Systems  
When the players are assumed to be computationally bounded, if cryptographic pseudorandom generators (or, equivalently, one-way functions) exist, then the players can base their strategies on "random-like  ...  In this work, we ask whether randomness is necessary for equilibria to exist in finitely repeated games.  ...  In the setting of repeated games, the random string used by the opponent's strategy can be thought of as the secret state.  ... 
doi:10.1007/s00224-016-9690-4 fatcat:qtnezgsljvgljgi6c5zww7fgke

Game Theory: Noncooperative Games [chapter]

Eric van Damme
2015 International Encyclopedia of the Social & Behavioral Sciences  
We describe noncooperative game models and discuss game theoretic solution concepts. Some applications are also noted. Conventional theory focuses on the question 'how will rational players play?'  ...  Motivated by experiments that show systematic theory violations, behavioral game theory aims to integrate insights from psychology to get better answers to the question 'how do humans play?'.  ...  In an extensive game, one can distinguish two types of randomization. When using a mixed strategy, the player randomizes over his pure strategies before the game starts.  ... 
doi:10.1016/b978-0-08-097086-8.71048-8 fatcat:pmhl3esmpbatda57pktcmxb7xe

Game Theory: Noncooperative Games [chapter]

E. van Damme
2001 International Encyclopedia of the Social & Behavioral Sciences  
We describe noncooperative game models and discuss game theoretic solution concepts. Some applications are also noted. Conventional theory focuses on the question 'how will rational players play?'  ...  Motivated by experiments that show systematic theory violations, behavioral game theory aims to integrate insights from psychology to get better answers to the question 'how do humans play?'.  ...  In an extensive game, one can distinguish two types of randomization. When using a mixed strategy, the player randomizes over his pure strategies before the game starts.  ... 
doi:10.1016/b0-08-043076-7/02230-0 fatcat:637xdmyzn5b5nequ3yaushucle

From repeated games to Brownian games

B De Meyer
1999 Annales de l'I.H.P. Probabilites et statistiques  
D We can now rephrase theorem 4.2.1 in a way that does not depend on a measurable selection p(x, t), since clearly R(x, t) = p(p(x, t)).  ...  -Let q, q' be two points of T) and let T be an optimal strategy in fi* (x, T). It follows then from the last theorem that: Since this relation holds Vt > T, we get T(q) = T(q'), as announced.  ...  More specifically, we will introduce in the next section the notion of Brownian games as a kind of limit in continuous time of the n times repeated games.  ... 
doi:10.1016/s0246-0203(99)80004-1 fatcat:3id7hp3qezhudgqfwxw3kvjh5u

GAMES, game theory and artificial intelligence

John T. Hanley
2021 Journal of Defense Analytics and Logistics  
limitations.  ...  It then provides a succinct summary of game theory for those designing and using games, with an emphasis on information conditions and solution concepts.  ...  In games with perfect recall, randomizing decisions can be deferred until actual decision points are reached.  ... 
doi:10.1108/jdal-10-2021-0011 fatcat:eivvqmedlvemtnjvaug7ppatwm

Dynamic routing games: An evolutionary game theoretic approach

Hamidou Tembine, Amar Prakash Azad
2011 IEEE Conference on Decision and Control and European Control Conference  
Further, we characterize the dynamic equilibria of the long-term game using evolutionary variational inequalities.  ...  Instead, we motivate our problem from the two basic facts: i) the path cost may not be exactly known in advance in dynamic environment unlike static; ii) long term solution is important aspect to evaluate  ...  Players from class i can learn x(t) via the ordinary differential equation (ODE) and 3 Notice that the number of players that can interact can be very large can use a route r with probability p i r .  ... 
doi:10.1109/cdc.2011.6161167 dblp:conf/cdc/TembineA11 fatcat:3ce6lrl7bzfvzbs636suehuhly

From Language Games to Drawing Games [article]

Chrisantha Fernando, Daria Zenkova, Stanislav Nikolov, Simon Osindero
2020 arXiv   pre-print
We attempt to automate various artistic processes by inventing a set of drawing games, analogous to the approach taken by emergent language research in inventing communication games.  ...  A critical difference is that drawing games demand much less effort from the receiver than do language games.  ...  Simulated pen holding robot arms that produce random oscillatory motions. 7. Random LSTM agents. 8. Random LSTM-GMM agents using the same archiecture as SketchRNN. 9.  ... 
arXiv:2010.02820v2 fatcat:rlsz66t6gvcurp7flobbbcrsv4

Inducing game rules from varying quality game play [article]

Alastair Flynn
2020 arXiv   pre-print
With random gameplay situations that would normally be encountered when humans play are not present.  ...  To address this limitation, we analyse the effect of using intelligent versus random gameplay traces as well as the effect of varying the number of traces in the training set.  ...  Any single player game in the GGP dataset can be analysed using puzzle solving techniques.  ... 
arXiv:2008.01664v1 fatcat:zv4oeylusbbhjdxzg6qfzvvzei

Game AI for Domination Games [chapter]

Chad Hogg, Stephen Lee-Urban, Héctor Muñoz-Avila, Bryan Auslander, Megan Smith
2011 Artificial Intelligence for Computer Games  
In this paper we present an overview of several techniques we have studied over the years to build game AI for domination games.  ...  Domination is a game style in which teams compete for control of map locations, and has been very popular over the years.  ...  The views, opinions, and findings contained in this paper are those of the authors and should not be interpreted as representing the official views or policies, either expressed or implied, of the NSF.  ... 
doi:10.1007/978-1-4419-8188-2_4 fatcat:dlf2kqgpbrehtihq4vf6r73ewe

Concurrent reachability games

Luca de Alfaro, Thomas A. Henzinger, Orna Kupferman
2007 Theoretical Computer Science  
We show that for finite state spaces, all three sets of winning states can be computed in polynomial time: type-1 states in linear time, and type-2 and type-3 states in quadratic time.  ...  These are zero-sum games, and the reachability objective is one of the most basic objectives: determining the set of states from which player 1 can win the game is a fundamental problem in control theory  ...  To prove that U * ⊆ Almost(R) we can repeat the argument used to show that U m ⊆ Almost(R) in the proof of Theorem 8.  ... 
doi:10.1016/j.tcs.2007.07.008 fatcat:tt75csp7mzfijcjl57zerqbede

Repeated signaling games

Ayça Kaya
2009 Games and Economic Behavior  
In this context a large class of possibly complex sequences of signals can be supported as the separating equilibrium actions of the "strong type" of the informed player.  ...  We analyze a class of repeated signaling games in which the informed player's type is persistent and the history of actions are perfectly observable.  ...  Equilibrium When analyzing the repeated game we will focus on pure strategy equilibria.  ... 
doi:10.1016/j.geb.2008.09.030 fatcat:jq55mmltjjfgzkmohztoviccxq

Identity Deception and Game Deterrence via Signaling Games

William Casey, Parisa Memarmoshrefi, Ansgar Kellner, Jose Andre Morales, Bud Mishra
2016 Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)  
Particularly, their critical roles in Wireless Ad-hoc networks (WANETs) have become even more prominent as they begin to be deployed in several application domains.  ...  Inspired by biological models of ant colonies and their dynamics studied via information asymmetric signaling games, we propose an architecture that can withstand Sybil attacks, similar to ants, using  ...  other hand, a time stamp can be used to limit its temporal validity as crypto coins.  ... 
doi:10.4108/eai.3-12-2015.2262519 dblp:journals/sesa/CaseyMKMM16 fatcat:6iy67ch34zhchaxhdxt5tu35pu

Minority Games [article]

C. H. Yeung, Y.-C. Zhang
2008 arXiv   pre-print
We present a simple introduction to the basic Minority Game (MG) introduced by Challet and Zhang in 1997 and discuss some of its physical properties and subsequent developments.  ...  We also introduce some of its variants include the Evolutionay Minority Game (EMG), the Thermal Minority Game (TMG), the simple Minority Game without information and the Grand-canonical Minority Game (  ...  The dotted line in Fig. 1 corresponds to the coin-toss limit (random choice limit), in which agents play by making random decisions at every rounds of the game.  ... 
arXiv:0811.1479v2 fatcat:v4dp6jqk5zhujaol7om3ryo5u4

Whither Game Theory? Towards a Theory of Learning in Games

Drew Fudenberg, David K. Levine
2016 Journal of Economic Perspectives  
This essay is based on our longer paper "Whither Game Theory" (Fudenberg and Levine 2016) , which can be found at http://www.dklevine.com/archive/refs4786969000000001307.pdf.  ...  to be useful for generating conjectures, and can be essential for developing quantitative results.  ...  In some settings, for example in repeated games, game theory does not do well on this score.  ... 
doi:10.1257/jep.30.4.151 fatcat:2nmwd2dp2jds3j4dxihzz7u5n4
« Previous Showing results 1 — 15 out of 161,689 results