@MASTERSTHESIS\{IMM2012-06222,
    author       = "C. J. Kisum",
    title        = "Implementation, test, and analysis of some solution concepts for repeated games and imperfect information games",
    year         = "2012",
    school       = "Technical University of Denmark, {DTU} Informatics, {E-}mail: reception@imm.dtu.dk",
    address      = "Asmussens Alle, Building 305, {DK-}2800 Kgs. Lyngby, Denmark",
    type         = "",
    note         = "Supervised by Associate Professor Valentin Goranko, vfgo@imm.dtu.dk, {DTU} Informatics",
    url          = "http://www.imm.dtu.dk/English.aspx",
    abstract     = "The work presented in this thesis covera an adaption of regret minimization as a solution concept for {2-}player non-cooperative strategic form games. And in addition an adaption of the regret minimization (Average regret minimization) proposed by V. Garanko. This solution concept is experimented with and compared to iterated regret minimization, as proposed by Halpern and Pass in 2009. This is solved by conducting a series of experiments with the different solution concepts. The experiments proved that average regret minimization has the same time complexity, but find the results in a single iteration. Furthermore the results of average regret minimization compared to those of iterated regret minimization. The results were very similar. This implied that average regret minimization was a better solution than iterated regret minimization."
}