Show simple item record

2006-09-10Buch DOI: 10.18452/2755
How fast is fast fictitious play?
dc.contributor.authorKummer, Bernd
dc.date.accessioned2017-06-15T18:11:52Z
dc.date.available2017-06-15T18:11:52Z
dc.date.created2008-03-07
dc.date.issued2006-09-10
dc.identifier.issn0863-0976
dc.identifier.urihttp://edoc.hu-berlin.de/18452/3407
dc.description.abstractWe present a modification of the fictitious play algorithm for matrix games by aggregating trivial original steps. The resulting new algorithm consists of comparable simple steps but has a much better rate of convergence. Modifications for solving large scale LP-programs, numerical results and some conjecture concerning the total effort of elementary steps for esuring an error $ < \varepsilon$ will be discussed.eng
dc.language.isoeng
dc.publisherHumboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, Institut für Mathematik
dc.subject.ddc510 Mathematik
dc.titleHow fast is fast fictitious play?
dc.typebook
dc.identifier.urnurn:nbn:de:kobv:11-10086822
dc.identifier.doihttp://dx.doi.org/10.18452/2755
local.edoc.container-titlePreprints aus dem Institut für Mathematik
local.edoc.pages16
local.edoc.type-nameBuch
local.edoc.container-typeseries
local.edoc.container-type-nameSchriftenreihe
local.edoc.container-volume2006
local.edoc.container-issue25
local.edoc.container-year2006
local.edoc.container-erstkatid2075199-0

Show simple item record