Aarhus University Seal / Aarhus Universitets segl

CS Colloquium - Kristoffer Arnsfelt Hansen

2019.06.26 | Dorthe Haagen Nielsen

Date Fri 06 Sep
Time 15:15 16:00
Location Building 5510-104 (INCUBA lille Aud.)

Title: Computational Complexity in Life, the Universe, and Everything Algorithmic Game Theory

Abstract:

Computational Complexity is the phenomenon that computational problems have intrinsic requirements for the amount of time or space required for their solution. We discuss how this phenomenon may give insight to a wide range of topics, as diverse as black holes, evolutionary biology, complex financial products, and human behavior. I am particular interested in the computational complexity of fixed point theorems of mathematics that provide the theoretical foundation of many economical and game theoretical models.  

About the lecture:

This lecture is organised to celebrate that Kristoffer Arnsfelt Hansen has been granted DKK 2.4 mill from the Independent Research Fund Denmark to do research in computational complexity in relation to game theory. The project will consider the computational complexity of equilibria and fixed points, where Kristoffer will study the complexity of equilibrium refinements and evolutionary stable strategies. Kristoffer will also study the computational complexity of Kakutani fixed points with applications to market equilibria.

There will be coffee and cake for everyone at the lecture.

Site Specific, Lecture / talk, Debate, CS frontpage, MADALGO , Featured, Students, Staff, Public/media, Alumni