Switch to German Switch to English

Contact

Algorithms and Complexity Group
Institute for Computer Science
Goethe University Frankfurt
Robert-Mayer-Strasse 11-15
D-60325 Frankfurt am Main

Secretary Office:
Jutta Nadland
Institute for Computer Science
Room 116
Tel.: +49 (0) 69 798-28119






New Paper in American Economic Journal: Microeconomics 17 Mar 2021

In our paper ''Reaping the Informational Surplus in Bayesian Persuasion'' (by Ronen Gradwohl, Niklas Hahn, Martin Hoefer, Rann Smorodinsky) we study a competitive scenario, in which several experts with knowledge about the state of the world want to influence the choice of a decision maker (e.g., consultants/lobbyists try to influence policy decisions of the government). Even if there is only slight uncertainty for each expert about the interests of other experts, then the decision maker can extract the full informational surplus -- by restricting to listen only to one expert, the emerging competition motivates them to reveal all information about the state of the world. The paper has been accepted for publication in American Economic Journal: Microeconomics, a top-journal in economics.



Daniel Schmand moves to University of Bremen 05 Feb 2021

Our alumni Daniel Schmand accepted an offer to become assistant professor in discrete optimization at University of Bremen. Congratulations Prof. Schmand!



Welcome 01 Feb 2021

We welcome Tim Koglin as a new member of our group.



WINE 2020 Live Stream 26 Nov 2020

The 16th Conf. Web and Internet Economics (WINE 2020), one of the main events in economics and computation, is happening virtually Dec 7-11, 2020. There will be a free live stream on YouTube with all invited and contributed talks. All talks are scheduled within a (Europe-friendly) time window from 8am to 5pm CET.



New Paper at ITCS 2021 2 Nov 2020

Our paper ''Algorithmic Persuasion with Evidence'' (by Martin Hoefer, Pasin Manurangsi, Alexandros Psomas) was accepted at the 12th Int. Conf. Innovations in Theoretical Computer Science (ITCS 2021), a top-conference in theory of computing.