نتایج جستجو برای: ریاضی games theory

تعداد نتایج: 841038  

Journal: :Logical Methods in Computer Science 2010
Furio Honsell Marina Lenisa

Using coalgebraic methods, we extend Conway’s theory of games to possibly non-terminating, i.e. non-wellfounded games (hypergames). We take the view that a play which goes on forever is a draw, and hence rather than focussing on winning strategies, we focus on non-losing strategies. Hypergames are a fruitful metaphor for non-terminating processes, Conway’s sum being similar to shuffling. We dev...

2009
Marc Daumas Érik Martin-Dorel Annick Truffert Michel Ventou

Results of game theory are often the keys to decisions of economical and political executives. They are also used to create internal tools of many decision making software. For example, coordination games may be cooperative games, when the players choose the strategies by a consensus decision making process, and game trees are used to represent some key cooperative games. Our theory of cooperat...

2005
Tim Rees

Evolutionary game theory has grown into an active area of research that bridges concepts from biology, evolution, nonlinear dynamics, and game theory. The mechanisms necessary to conduct an evolutionary analysis of games are presented. Relations between evolutionary stable strategies and Nash equilibria are considered. Replicator dynamics are developed and applied to three relevant games. The a...

2011
WYNN C. STIRLING

Game theory explains how to make good choices when different decision makers have conflicting interests. The classical approach assumes that decision makers are committed to making the best choices for themselves regardless of the effect on others, but such an approach is less appropriate when cooperation, compromise, and negotiation are important. This book describes conditional games, an exte...

2008
Chiu Fan Lee Neil F. Johnson

We pursue a general theory of quantum games. In particular, we develop quantum generalizations of the two most important theorems from classical game theory: the Minimax Theorem and the Nash Equilibrium Theorem. We then show that quantum games are more efficient than classical games, and provide a saturated upper bound for this efficiency. [email protected] [email protected]

1999
Matteo Marsili Damien Challet Riccardo Zecchina

We discuss a recently introduced model of heterogeneous interacting agents behaving under inductive rationality. We derive the exact solution of the model in the limit of infinitely many agents using tools of statistical physics of disordered systems. Our results show that the impact of agents on the collective behavior plays a key role: even though for each agent this effect is very small, the...

2005
Anders Sundnes Løvlie

Espen Aarseth recently claimed that all games referred to as ’narrative games’ could better be described as ’quest games’. The writer of this paper suggests that Max Payne is a possible counter-example to this hypothesis; i.e. a game with a strong focus on narrative which is not easily understood as a quest game. The writer suggests that this, and other similar games, could better be understood...

2013
Teresa de la Hera Conde-Pumpido

In this paper I propose a new theory for the study of persuasiveness within digital games. This theory aims to make visible how persuasiveness can be structured within digital games and to be useful to identify specific aspects of games' persuasiveness that might not be obvious to the naked eye, by giving them order and conferring them intelligibility. The theory that I propose here is based on...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید