How fast is fast fictitious play?
| dc.contributor.author | Kummer, Bernd | |
| dc.date.accessioned | 2017-06-15T18:11:52Z | |
| dc.date.available | 2017-06-15T18:11:52Z | |
| dc.date.created | 2008-03-07 | |
| dc.date.issued | 2006-09-10 | |
| dc.identifier.issn | 0863-0976 | |
| dc.identifier.uri | http://edoc.hu-berlin.de/18452/3407 | |
| dc.description.abstract | We 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.iso | eng | |
| dc.publisher | Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, Institut für Mathematik | |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
| dc.subject.ddc | 510 Mathematik | |
| dc.title | How fast is fast fictitious play? | |
| dc.type | book | |
| dc.identifier.urn | urn:nbn:de:kobv:11-10086822 | |
| dc.identifier.doi | http://dx.doi.org/10.18452/2755 | |
| local.edoc.pages | 16 | |
| local.edoc.type-name | Buch | |
| local.edoc.container-type | series | |
| local.edoc.container-type-name | Schriftenreihe | |
| local.edoc.container-year | 2006 | |
| dc.identifier.zdb | 2075199-0 | |
| bua.series.name | Preprints aus dem Institut für Mathematik | |
| bua.series.issuenumber | 2006,25 |
