Sciweavers

24 search results - page 5 / 5
» On No-Regret Learning, Fictitious Play, and Nash Equilibrium
Sort
View
ICML
2005
IEEE
14 years 5 months ago
Learning to compete, compromise, and cooperate in repeated general-sum games
Learning algorithms often obtain relatively low average payoffs in repeated general-sum games between other learning agents due to a focus on myopic best-response and one-shot Nas...
Jacob W. Crandall, Michael A. Goodrich
GECCO
2006
Springer
134views Optimization» more  GECCO 2006»
13 years 8 months ago
The Baldwin effect under spatial isolation and autonomous reproduction
The impact of learning on evolution in dynamic environments undergoes recognized stages of the Baldwin Effect although its cause is not clear. To identify it experimentally, we de...
H. L. Peng, J. C. Tay
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
JSAC
2007
189views more  JSAC 2007»
13 years 4 months ago
Non-Cooperative Power Control for Wireless Ad Hoc Networks with Repeated Games
— One of the distinctive features in a wireless ad hoc network is lack of any central controller or single point of authority, in which each node/link then makes its own decision...
Chengnian Long, Qian Zhang, Bo Li, Huilong Yang, X...