Sciweavers

1698 search results - page 61 / 340
» Growing Complex Games
Sort
View
CSJM
2006
81views more  CSJM 2006»
14 years 9 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
BMCBI
2006
122views more  BMCBI 2006»
14 years 9 months ago
A domain-oriented approach to the reduction of combinatorial complexity in signal transduction networks
Background:Receptors and scaffold proteins possess a number of distinct domains and bind multiple partners. A common problem in modeling signaling systems arises from a combinator...
Holger Conzelmann, Julio Saez-Rodriguez, Thomas Sa...
ATAL
2001
Springer
15 years 2 months ago
A Stable and Feasible Payoff Division for Coalition Formation in a Class of Task Oriented Domains
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
María-Victoria Belmonte, Ricardo Conejo, Jo...
EDUTAINMENT
2006
Springer
15 years 1 months ago
A Theatre of Ethics and Interaction? Bertolt Brecht and Learning to Behave in First-Person Shooter Environments
This paper explores the nature of player behaviour in game environments in relation to the methodology of the dramatist Bertolt Brecht. Firstly, a conceptualisation of how manipula...
Dan Pinchbeck
CORR
2007
Springer
99views Education» more  CORR 2007»
14 years 9 months ago
A parametric representation of totally mixed Nash equilibria
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
Gabriela Jeronimo, Daniel Perrucci, Juan Sabia