TY - GEN
T1 - Recent developments in learning and competition with finite automata
T2 - 2nd International Workshop on Internet and Network Economics, WINE 2006
AU - Neyman, Abraham
PY - 2006
Y1 - 2006
N2 - Consider a repeated two-person game. The question is how much smarter should a player be to effectively predict the moves of the other player. The answer depends on the formal definition of effective prediction, the number of actions each player has in the stage game, as well as on the measure of smartness. Effective prediction means that, no matter what the stage-game payoff function, the player can play (with high probability) a best reply in most stages. Neyman and Spencer [4] provide a complete asymptotic solution when smartness is measured by the size of the automata that implement the strategies.
AB - Consider a repeated two-person game. The question is how much smarter should a player be to effectively predict the moves of the other player. The answer depends on the formal definition of effective prediction, the number of actions each player has in the stage game, as well as on the measure of smartness. Effective prediction means that, no matter what the stage-game payoff function, the player can play (with high probability) a best reply in most stages. Neyman and Spencer [4] provide a complete asymptotic solution when smartness is measured by the size of the automata that implement the strategies.
UR - http://www.scopus.com/inward/record.url?scp=77049106100&partnerID=8YFLogxK
U2 - 10.1007/11944874_1
DO - 10.1007/11944874_1
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:77049106100
SN - 3540681388
SN - 9783540681380
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 2
BT - Internet and Network Economics - Second International Workshop, WINE 2006, Proceedings
Y2 - 15 December 2006 through 17 December 2006
ER -