Paul+Fischer

a German mathematician, computer scientist and associate professor and head of the algorithms, logic, and graphs (AlgoLoG) section at [|Technical University of Denmark], [|Kongens Lyngby]. He holds a M.Sc. in 1983 and Ph.D. 1986 in mathematics from [|Bielefeld University], and a [|habilitation] in CS from University of Dortmund in 1995. His research interests include [|computability theory] such as [|reduction] of [|recursively enumerable] [|Turing degrees] and [|weak truth-table degrees], algorithmic learning, [|bandit problems] and [|time series] analysis. He has also written about GUI programming using Java [|Swing]. || toc =Bandit Problems= In [|probability theory], the [|multi-armed bandit problem] faces the tradeoff between [|exploitation] of the [|slot machine] that has the highest expected payoff and [|exploration] to get more information about the expected payoffs of the other machines. The trade-off between exploration and exploitation is also topic in reinforcement learning. The [|gambler] has to decide at time steps t = 1, 2, ... which of the finitely many available arms to pull. Each arm produces a [|reward] in a [|stochastic] manner. The goal is to maximize the reward accumulated over time. In 2002, along with Peter Auer and Nicolò Cesa-Bianchi, Paul Fischer introduced the **UCB1** (Upper Confidence Bounds) bandit algorithm, which was applied as selection algorithm UCT to Monte-Carlo Tree Search as elaborated by Levente Kocsis and Csaba Szepesvári in 2006.
 * Home * People * Paul Fischer**
 * [[image:paf.jpg width="200" link="http://www2.imm.dtu.dk/~pafi/"]] ||~ || **Paul Fischer**,
 * Paul Fischer ||~ ||^ ||

=Selected Publications=

1983 ...

 * Paul Fischer (**1983**). //Paare ohne Infimum in den rekursiv aufzählbaren Turing und wtt-Graden//. Masters thesis, [|Bielefeld University] (German)
 * Paul Fischer (**1986**). //Some Results on Recursively Enumerable Degrees of Weak Reducibilities//. Ph.D. thesis, [|Bielefeld University]

1990 ...

 * Paul Fischer (**1993**). //Finding Maximum Convex Polygons//. [|FCT 1993], [|LNCS] 710, [|Springer]
 * Paul Fischer (**1994**). //Über Algorithmisches Lernen//. Habilitation thesis, University of Dortmund (German)
 * Paul Fischer (**1997**). //Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon//. [|Computational Geometry, Vol. 7]
 * Nicolò Cesa-Bianchi, Paul Fischer (**1998**). //Finite-Time Regret Bounds for the Multiarmed Bandit Problem//. [|ICML 1998], [|CiteSeerX]
 * Paul Fischer, Hans Ulrich Simon (eds.)(**1999**). //[|Computational Learning Theory]//. [|EuroCOLT'99], [|LNCS] 1572, [|Springer]

2000 ...

 * Peter Auer, Nicolò Cesa-Bianchi, Paul Fischer (**2002**). //[|Finite-time Analysis of the Multiarmed Bandit Problem]//. [|Machine Learning], Vol. 47, No. 2, [|pdf]
 * Paul Fischer (**2005**). //An Introduction to Graphical User Interfaces with Java Swing//. [|Pearson Education], [|Addison-Wesley], [|Amazon.de]

2010 ...

 * [|Karunakar Reddy Bayyapu], Paul Fischer (**2015**). //[|Load Scheduling in a Cloud Based Massive Video-Storage Environment]//. [|SYNASC 2014], DOI: [|10.1109/SYNASC.2014.54]

=External Links=
 * [|Paul Fischer - Associate Professor]
 * [|Paul Fischer - DTU Orbit]

=References= =What links here?= include page="Paul Fischer" component="backlinks" limit="40"
 * Up one Level**