Um método Kernel para estimativa de densidade e sua aplicação em jogos de repetição
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Universidade Federal de Juiz de Fora (UFJF)
DOI
Abstract
Repeated games is a branch of game theory, where a game can be played several times
by the players involved. In this setting, it is assumed that the players do not always
play the optimal strategy or that they may be willing to collaborate. In this context
it is possible for a player to analyze the opponent’s behaviour to find patters. These
patterns can be used to maximize the player’s profit or to detect if the opponent is willing
to collaborate. On this dissertation it is proposed a new algorithm based on similarity
kernel capable of predicting the opponent’s actions on repeated games. The prediction is
not limited to the next round’s action, being able to predict actions on a finite sequence
of rounds. It is able to adapt rapidly if the opponents change their strategies during the
course of a game. It is shown empirically that the proposed algorithm achieves better
results than the current state of the art.
Description
Citation
Endorsement
Review
Supplemented By
Referenced By
Rights and licensing
Acesso Aberto
