Search Results for author: Rasmus Ibsen-Jensen

Found 4 papers, 0 papers with code

All-Pay Bidding Games on Graphs

no code implementations19 Nov 2019 Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec

On the positive side, we show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation for the optimal strategy for that ratio.

Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs

no code implementations21 Jun 2017 Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak

We present faster polynomial-time Monte-Carlo algorithms for finidng the fixation probability on undirected graphs.

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components

no code implementations26 Oct 2015 Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis

For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time.

Programming Languages Data Structures and Algorithms F.3.2

Generalized Risk-Aversion in Stochastic Multi-Armed Bandits

no code implementations5 May 2014 Alexander Zimin, Rasmus Ibsen-Jensen, Krishnendu Chatterjee

We consider the problem of minimizing the regret in stochastic multi-armed bandit, when the measure of goodness of an arm is not the mean return, but some general function of the mean and the variance. We characterize the conditions under which learning is possible and present examples for which no natural algorithm can achieve sublinear regret.

Multi-Armed Bandits

Cannot find the paper you are looking for? You can Submit a new open access paper.