A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering. - Vera Traub; Thorben Tröbst (IPCO, 2020)

An Arrow-Debreu Extension of the Hylland-Zeckhauser Scheme: Equilibrium Existence and Algorithms. - Jugal Garg; Thorben Tröbst; Vijay V. Vazirani (CoRR, 2020)

Combinatorial Algorithms for Matching Markets via Nash Bargaining: One-Sided, Two-Sided and Non-Bipartite. - Ioannis Panageas; Thorben Tröbst; Vijay V. Vazirani (CoRR, 2021)

A fast $(2 + frac{2}{7})$-approximation algorithm for capacitated cycle covering. - Vera Traub; Thorben Tröbst (Math. Program., 2022)

A Nash-Bargaining-Based Mechanism for One-Sided Matching Markets and Dichotomous Utilities. - Jugal Garg; Thorben Tröbst; Vijay V. Vazirani (AAMAS, 2023)

Two-Sided Matching Markets: Impossibility Results on Existence of Efficient and Envy Free Solutions. - Thorben Tröbst; Vijay V. Vazirani (CoRR, 2023)

A real polynomial for bipartite graph minimum weight perfect matchings. - Thorben Tröbst; Vijay V. Vazirani (Inf. Process. Lett., 2023)

Online Matching with High Probability. - Milena Mihail; Thorben Tröbst (SAGT, 2024)

Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability. - Thorben Tröbst; Vijay V. Vazirani (EC, 2024)

Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks. - Jannis Blauth; Stephan Held; Dirk Müller 003; Niklas Schlomberg; Vera Traub; Thorben Tröbst; Jens Vygen (Discret. Optim., 2024)

Almost tight bounds for online hypergraph matching. - Thorben Tröbst; Rajan Udwani (Oper. Res. Lett., 2024)

Cardinal-Utility Matching Markets and Online Matching - Thorben Tröbst (2024)

One-sided matching markets with endowments: equilibria and algorithms. - Jugal Garg; Thorben Tröbst; Vijay V. Vazirani (Auton. Agents Multi Agent Syst., 2024)

Matching Markets with Chores. - Jugal Garg; Thorben Tröbst; Vijay V. Vazirani (AAMAS, 2025)