Sciweavers

5995 search results - page 188 / 1199
» Algorithmic Game Theory
Sort
View
151
Voted
ATAL
2008
Springer
15 years 6 months ago
Stochastic search methods for nash equilibrium approximation in simulation-based games
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
Yevgeniy Vorobeychik, Michael P. Wellman
TIP
2010
111views more  TIP 2010»
14 years 10 months ago
Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
Yue M. Lu, Mina Karzand, Martin Vetterli
96
Voted
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
16 years 4 months ago
Parallel repetition: simplifications and the no-signaling case
: Consider a game where a referee chooses (x,y) according to a publicly known distribution, sends x to Alice, and y to Bob. Without communicating with each other, Alice responds wi...
Thomas Holenstein
112
Voted
DAGSTUHL
2007
15 years 5 months ago
Equilibrium Tracing in Bimatrix Games
Abstract. We analyze the relations of the van den Elzen-Talman algorithm, the Lemke-Howson algorithm and the global Newton method introduced by Govindan and Wilson. It is known tha...
Anne Balthasar
AAAI
2011
14 years 4 months ago
Learning in Repeated Games with Minimal Information: The Effects of Learning Bias
Automated agents for electricity markets, social networks, and other distributed networks must repeatedly interact with other intelligent agents, often without observing associate...
Jacob W. Crandall, Asad Ahmed, Michael A. Goodrich