Thorben Tröbst

Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

2024

One-sided matching markets with endowments: equilibria and algorithms.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., December, 2024

Cardinal-Utility Matching Markets and Online Matching

[BibT_eX]

[DOI]

PhD thesis, 2024

Almost tight bounds for online hypergraph matching.

[BibT_eX]

[DOI]

Rajan Udwani

Oper. Res. Lett., 2024

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

[BibT_eX]

[DOI]

Discret. Optim., 2024

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

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Online Matching with High Probability.

[BibT_eX]

[DOI]

Milena Mihail

Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

2023

A real polynomial for bipartite graph minimum weight perfect matchings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

A Nash-Bargaining-Based Mechanism for One-Sided Matching Markets and Dichotomous Utilities.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Vera Traub

Math. Program., 2022

2021

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

[BibT_eX]

[DOI]

Ioannis Panageas

CoRR, 2021

2020

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

[BibT_eX]

[DOI]

CoRR, 2020

A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering.

[BibT_eX]

[DOI]

Vera Traub