default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThorben Tröbst
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Jugal Garg, Thorben Tröbst, Vijay V. Vazirani:
One-sided matching markets with endowments: equilibria and algorithms. Auton. Agents Multi Agent Syst. 38(2): 40 (2024)- [j4]Jannis Blauth
, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen:
Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks. Discret. Optim. 53: 100848 (2024) - [j3]Thorben Tröbst, Rajan Udwani:
Almost tight bounds for online hypergraph matching. Oper. Res. Lett. 55: 107143 (2024) - [c5]Milena Mihail, Thorben Tröbst:
Online Matching with High Probability. SAGT 2024: 21-34 - [c4]Thorben Tröbst, Vijay V. Vazirani:
Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability. EC 2024: 42 - [i8]Thorben Tröbst, Rajan Udwani:
Almost Tight Bounds for Online Hypergraph Matching. CoRR abs/2402.08775 (2024) - [i7]Thorben Tröbst, Vijay V. Vazirani:
Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability. CoRR abs/2402.08851 (2024) - 2023
- [j2]Thorben Tröbst, Vijay V. Vazirani:
A real polynomial for bipartite graph minimum weight perfect matchings. Inf. Process. Lett. 179: 106286 (2023) - [c3]Jugal Garg, Thorben Tröbst, Vijay V. Vazirani:
A Nash-Bargaining-Based Mechanism for One-Sided Matching Markets and Dichotomous Utilities. AAMAS 2023: 2721-2723 - [i6]Thorben Tröbst, Vijay V. Vazirani:
Two-Sided Matching Markets: Impossibility Results on Existence of Efficient and Envy Free Solutions. CoRR abs/2310.16807 (2023) - 2022
- [j1]Vera Traub, Thorben Tröbst:
A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering. Math. Program. 192(1): 497-518 (2022) - [c2]Jugal Garg, Thorben Tröbst, Vijay V. Vazirani:
One-Sided Matching Markets with Endowments: Equilibria and Algorithms. AAMAS 2022: 463-471 - [i5]Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen:
Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks. CoRR abs/2205.00889 (2022) - 2021
- [i4]Ioannis Panageas, Thorben Tröbst, Vijay V. Vazirani:
Combinatorial Algorithms for Matching Markets via Nash Bargaining: One-Sided, Two-Sided and Non-Bipartite. CoRR abs/2106.02024 (2021) - [i3]Milena Mihail, Thorben Tröbst:
Online Matching with High Probability. CoRR abs/2112.07228 (2021) - 2020
- [c1]Vera Traub, Thorben Tröbst:
A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering. IPCO 2020: 391-404 - [i2]Thorben Tröbst, Vijay V. Vazirani:
A Real Polynomial for Bipartite Graph Minimum Weight Perfect Matchings. CoRR abs/2003.08917 (2020) - [i1]Jugal Garg, Thorben Tröbst, Vijay V. Vazirani:
An Arrow-Debreu Extension of the Hylland-Zeckhauser Scheme: Equilibrium Existence and Algorithms. CoRR abs/2009.10320 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
