Sciweavers

5995 search results - page 14 / 1199
» Algorithmic Game Theory
Sort
View
ECAI
2006
Springer
14 years 2 months ago
Cheating Is Not Playing: Methodological Issues of Computational Game Theory
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
Bruno Beaufils, Philippe Mathieu
ATAL
2007
Springer
14 years 5 months ago
Automatic feature extraction for autonomous general game playing agents
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...
David M. Kaiser
TSP
2008
116views more  TSP 2008»
13 years 10 months ago
Optimal Linear Precoding Strategies for Wideband Noncooperative Systems Based on Game Theory - Part I: Nash Equilibria
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
14 years 3 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
ATAL
2007
Springer
14 years 5 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein