Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, January 11, 2007, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Julian Lorenz

Optimal Competitive Algorithms for the k-Search Problem with Application in Robust Valuation of Lookback Options

In this talk we consider the k-search problem: A player is searching for the k highest prices in a sequence that is unveiled one price quotation after another. At each quotation, the player has to decide immediately whether to accept or not. Using the competitive ratio as a performance measure, we give optimal deterministic and randomized algorithms. In the second part of the talk, these algorithms are used to price a certain type of financial options, namely "lookback options". We derive upper bounds for the price of these securities (under a no-arbitrage assumption), and compare to classical option pricing.

Joint work with K. Panagiotou and A. Steger.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login