Thorben Tröbst

Orcid: 0000-0003-3350-7337

According to our database1, Thorben Tröbst authored at least 12 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
One-sided matching markets with endowments: equilibria and algorithms.
Auton. Agents Multi Agent Syst., December, 2024

Almost tight bounds for online hypergraph matching.
Oper. Res. Lett., 2024

Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks.
Discret. Optim., 2024

Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability.
CoRR, 2024

Online Matching with High Probability.
Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

2023
A real polynomial for bipartite graph minimum weight perfect matchings.
Inf. Process. Lett., 2023

Two-Sided Matching Markets: Impossibility Results on Existence of Efficient and Envy Free Solutions.
CoRR, 2023

A Nash-Bargaining-Based Mechanism for One-Sided Matching Markets and Dichotomous Utilities.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering.
Math. Program., 2022

2021
Combinatorial Algorithms for Matching Markets via Nash Bargaining: One-Sided, Two-Sided and Non-Bipartite.
CoRR, 2021

2020
An Arrow-Debreu Extension of the Hylland-Zeckhauser Scheme: Equilibrium Existence and Algorithms.
CoRR, 2020

A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020


  Loading...