Sciweavers

5995 search results - page 6 / 1199
» Algorithmic Game Theory
Sort
View
AAAI
2006
14 years 10 months ago
A Value Theory of Meta-Learning Algorithms
We use game theory to analyze meta-learning algorithms. The objective of meta-learning is to determine which algorithm to apply on a given task. This is an instance of a more gene...
Abraham Bagherjeiran
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
15 years 3 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
GLOBECOM
2006
IEEE
15 years 3 months ago
Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game
— This paper develops a hierarchical iterative OSNR algorithm based on a game theory framework. A Nash game is formulated between channels with channel utility related to maximiz...
Lacra Pavel
DAGSTUHL
2007
14 years 11 months ago
Homotopy Methods to Compute Equilibria in Game Theory
This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements....
P. Jean-Jacques Herings, Ronald Peeters
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
14 years 7 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...