Switch to German Switch to English

News


Invited Talk 29 Jul 2022

Martin Hoefer will give an invited talk at the 12th Days on Computational Game Theory on Sep 29/30, 2022 at University of Bremen.



Welcome 1 Jul 2022

Our former secretary Jutta Nadland retired on June 30. We thank her for the many contributions to our team and the excellent service, and we wish her all the best!
At the same time, we welcome Marta Soares as the new secretary in our group.



New Paper at SAGT 2022 1 July 2022

Our paper ''Seniorities and Minimal Clearing in Financial Network Games'' (by Martin Hoefer, Lisa Wilhelmi) was accepted at the 15th Int. Symposium on Algorithmic Game Theory (SAGT 2022).



Graduation Awards 30 Jun 2022

Several (former) members of our group received awards for oustanding performances among the 2021/22 graduates in Computer Science at Goethe University:


Congratulations to all of them, well deserved!



New Paper at EC 2022 9 May 2022

Our paper ''Public Signals in Network Congestion Games'' (by Svenja Griesbach, Martin Hoefer, Max Klimm, Tim Koglin) was accepted at the 23rd ACM Conference on Economics and Computation (EC 2022), the international top conference at the intersection of computer science and economics.



Thesis Defense 27 Apr 2022

Niklas Hahn successfully defended his thesis entitled Algorithms for Bayesian Persuasion and Delegated Search. Starting in May 2022 he will be a postdoc in the RO team of the LIP6 lab at Sorbonne University.
Congratulations to Dr. Hahn!



New Paper at IJCAI 2022 20 Apr 2022

Our paper ''Approximate Strategyproof Mechanisms for the Additively Separable Group Activity Selection Problem'' (by Michele Flammini, Giovanna Varricchio) was accepted at the 31st Int. Joint Conference on Artificial Intelligence (IJCAI 2022), one of the two international top conferences in artificial intelligence.



Visitor 5 Apr 2022

Kevin Schewior is visiting our group Apr 19-21.



Welcome 1 Apr 2022

We welcome Conrad Schecker as a new member of our group.



New Paper in Games and Economic Behavior 18 Jan 2022

In our paper ''The Secretary Recommendation Problem'' (by Niklas Hahn, Martin Hoefer, Rann Smorodinsky) we study a basic sequential recommendation problem. A sender (e.g., a social network) decides to recommend taking an action (e.g., clicking on certain media content) to a receiver (user in the network). Actions can have different utilities for sender and receiver, which are known upfront to the sender (but not to the receiver). As such, the receiver must rely on the sender to give informative advice. We analyze the scenario when actions become (un-)available sequentially over time. Our results are near-optimal algorithms to compute good recommendation strategies for the sender. On a technical level, we provide a novel connection between classic stopping theory and persuasion/signaling aspects. The paper has been accepted for publication in Games and Economic Behavior, the top journal in game theory.



New Paper at AAMAS 2022 19 Dec 2021

Our paper ''Asynchronous Opinion Dynamics in Social Networks'' (by Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau, Daniel Schmand) was accepted at the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022), the international top conference on multiagent systems.



New Paper at AAAI 2022 01 Dec 2021

Our paper ''Maximizing Nash Social Welfare in 2-Value Instances'' (by Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer, Kurt Mehlhorn, Marco Schmalhofer, Golnoosh Shahkarami, Giovanna Varricchio, Quentin Vermande, Ernest van Wijland) was accepted at the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), one of the two international top conferences in artificial intelligence.



New Paper in Journal of Artificial Intelligence Research 26 Nov 2021

In ''Fair Division of Indivisible Goods for a Class of Concave Valuations'' (by Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn) we study approximation algorithms for fair allocation of a set of indivisible goods to a set of agents. Our algorithm computes a near-optimal allocation in terms of the geometric mean (also termed Nash social welfare) of agent valuations. In addition, the allocation satisfies approximate versions of envy-freeness, a standard fairness concept in the literature. Our results unify and extend existing techniques for approximating Nash social welfare for additive valuations to a more general, concave and non-separable class of valuation functions. The paper has been accepted for publication in Journal of Artificial Intelligence Research, a top journal in artificial intelligence.



Graduation Award 22 Oct 2021

Lisa Wilhelmi received the award for the best M.Sc. graduate of 2020/21 in Computer Science at Goethe University. Congratulations, well deserved!



New Paper in Mathematics of Operations Research 8 Sep 2021

In our paper ''Algorithms for Persuasion with Limited Communication'' (by Ronen Gradwohl, Niklas Hahn, Martin Hoefer, Rann Smorodinsky) we study the problem faced by a recommendation engine (e.g., a website for hotel booking or travel) that wants to persuade a user with a recommendation. We analyze restrictions on the signal space such that there are more potential actions by the user than signals that can be issued for recommendation. For symmetric instances, when a priori all actions have similar profits, we characterize and design efficient algorithms for optimal recommendation schemes for the engine. In a subclass of instances, where profits are independent among actions, we obtain an algorithm that computes a near-optimal scheme. The paper has been accepted for publication in Mathematics of Operations Research, a leading journal in operations research.



Tutorial on Algorithms and Information Design at SAGT 2021 27 Aug 2021

Stay tuned for our tutorial on Algorithmic Challenges in Information Design; on 21 Sep 2021 at SAGT in Aarhus (and online).



New Paper at SAGT 2021 29 Jun 2021

Our paper ''When Dividing Mixed Manna is Easier than Dividing Goods: Competitive Equilibria with a Constant Number of Chores'' (by Jugal Garg, Martin Hoefer, Peter McGlaughlin, Marco Schmalhofer) was accepted at the 14th Int. Symposium on Algorithmic Game Theory (SAGT 2021).



New Paper at IJCAI 2021 29 Apr 2021

Our paper ''Stochastic Probing with Increasing Precision'' (by Martin Hoefer, Kevin Schewior, Daniel Schmand) was accepted at the 30th Int. Joint Conference on Artificial Intelligence (IJCAI 2021), one of the two international top conferences in artificial intelligence.



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 group member Daniel Schmand accepted an offer to become assistant professor in discrete optimization at University of Bremen. Congratulations Prof. Schmand!



Welcome 1 Feb 2021

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







Click here for older news