Thorben Tröbst

22 papers A* 1A 3B 2Journal 14Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	Matching Markets with Chores. AAMAS Jugal Garg, Thorben Tröbst, Vijay V. Vazirani
2024	J	`jnl`	Almost Tight Bounds for Online Hypergraph Matching. CoRR Thorben Tröbst, Rajan Udwani
2024	J	`jnl`	Almost tight bounds for online hypergraph matching. Oper. Res. Lett. Thorben Tröbst, Rajan Udwani
2024	—	`—`	Cardinal-Utility Matching Markets and Online Matching Thorben Tröbst
2024	A*	`conf`	Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability. EC Thorben Tröbst, Vijay V. Vazirani
2024	J	`jnl`	Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability. CoRR Thorben Tröbst, Vijay V. Vazirani
2024	J	`jnl`	Matching Markets with Chores. CoRR Jugal Garg, Thorben Tröbst, Vijay V. Vazirani
2024	J	`jnl`	One-sided matching markets with endowments: equilibria and algorithms. Auton. Agents Multi Agent Syst. Jugal Garg, Thorben Tröbst, Vijay V. Vazirani
2024	B	`conf`	Online Matching with High Probability. SAGT Milena Mihail, Thorben Tröbst
2024	—	`conf`	Time-Efficient Algorithms for Nash-Bargaining-Based Matching Market Models. WINE Ioannis Panageas, Thorben Tröbst, Vijay V. Vazirani
2024	J	`jnl`	Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks. Discret. Optim. Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
2023	A	`conf`	A Nash-Bargaining-Based Mechanism for One-Sided Matching Markets and Dichotomous Utilities. AAMAS Jugal Garg, Thorben Tröbst, Vijay V. Vazirani
2023	J	`jnl`	A real polynomial for bipartite graph minimum weight perfect matchings. Inf. Process. Lett. Thorben Tröbst, Vijay V. Vazirani
2023	J	`jnl`	Two-Sided Matching Markets: Impossibility Results on Existence of Efficient and Envy Free Solutions. CoRR Thorben Tröbst, Vijay V. Vazirani
2022	J	`jnl`	A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering. Math. Program. Vera Traub, Thorben Tröbst
2022	A	`conf`	One-Sided Matching Markets with Endowments: Equilibria and Algorithms. AAMAS Jugal Garg, Thorben Tröbst, Vijay V. Vazirani
2022	J	`jnl`	Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks. CoRR Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
2021	J	`jnl`	Combinatorial Algorithms for Matching Markets via Nash Bargaining: One-Sided, Two-Sided and Non-Bipartite. CoRR Ioannis Panageas, Thorben Tröbst, Vijay V. Vazirani
2021	J	`jnl`	Online Matching with High Probability. CoRR Milena Mihail, Thorben Tröbst
2020	B	`conf`	A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering. IPCO Vera Traub, Thorben Tröbst
2020	J	`jnl`	A Real Polynomial for Bipartite Graph Minimum Weight Perfect Matchings. CoRR Thorben Tröbst, Vijay V. Vazirani
2020	J	`jnl`	An Arrow-Debreu Extension of the Hylland-Zeckhauser Scheme: Equilibrium Existence and Algorithms. CoRR Jugal Garg, Thorben Tröbst, Vijay V. Vazirani