10 citations · 10 across the 2 of their papers we have counts for
4 papers
Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks
Junghyun Lee, Laura Schmid, Se-Young Yun
Multi-armed bandits are extensively used to model sequential decision-making, making them ubiquitous in many real-life applications such as online recommender systems and wireless…
Large Language Models Are Reasoning Teachers
Namgyu Ho, Laura Schmid, Se-Young Yun
Recent works have shown that chain-of-thought (CoT) prompting can elicit language models to solve complex reasoning tasks, step-by-step. However, prompt-based CoT methods are depen…
Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory
Juho Hirvonen, Laura Schmid, Krishnendu Chatterjee +1
Graphical games are a useful framework for modeling the interactions of (selfish) agents who are connected via an underlying topology and whose behaviors influence each other. They…
The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game
Krishnendu Chatterjee, Laura Schmid, Stefan Schmid
The Price of Anarchy (PoA) is a well-established game-theoretic concept to shed light on coordination issues arising in open distributed systems. Leaving agents to selfishly optimi…