Sciweavers

1653 search results - page 6 / 331
» Computer science and game theory
Sort
View
ICPP
2009
IEEE
14 years 2 months ago
Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
Jonathan Widger, Daniel Grosu
JACM
2007
160views more  JACM 2007»
13 years 7 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
ICGA
2006
312views Optimization» more  ICGA 2006»
15 years 7 months ago
New Approximate Strategies for Playing Sum Games based on Subgame Types
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
Manal Zaky, Cherif Salama, Salma Ghoneim
ANSOFT
1998
157views more  ANSOFT 1998»
13 years 7 months ago
Software Engineering Programmes are not Computer Science Programmes
Programmes in “Software Engineering” have become a source of contention in many universities. Computer Science departments, many of which have used that phrase to describe ind...
David Lorge Parnas
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm