Sciweavers

52 search results - page 3 / 11
» Approximate Convex Optimization by Online Game Playing
Sort
View
ATAL
2008
Springer
13 years 7 months ago
Emerging coordination in infinite team Markov games
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
Francisco S. Melo, M. Isabel Ribeiro
EJC
2007
13 years 5 months ago
Online balanced graph avoidance games
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
SAGT
2010
Springer
167views Game Theory» more  SAGT 2010»
13 years 4 months ago
A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher’s market model under additively separable, piecewise-linear, concave utilities (pl...
Gagan Goel, Vijay V. Vazirani
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
13 years 24 days ago
Learning in mean-field oscillator games
This research concerns a noncooperative dynamic game with large number of oscillators. The states are interpreted as the phase angles for a collection of non-homogeneous oscillator...
Huibing Yin, Prashant G. Mehta, Sean P. Meyn, Uday...
AAAI
2004
13 years 7 months ago
Temperature Discovery Search
Temperature Discovery Search (TDS) is a new minimaxbased game tree search method designed to compute or approximate the temperature of a combinatorial game. TDS is based on the co...
Martin Müller 0003, Markus Enzenberger, Jonat...