Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThành Nguyen 0001
Person information
- affiliation: Purdue University, Krannert School of Management, West Lafayette, IN, USA
- affiliation: Northwestern University, Kellogg School of Management, Evanston, IL, USA
- affiliation (PhD): Cornell University, Ithaca, NY, USA
Other persons with the same name
- Thanh Nguyen (aka: Thành Nguyen) — disambiguation page
- Thanh Nguyen 0002 (aka: William Nguyen) — Graz University of Technology (and 1 more)
- Thanh Nguyen 0003 — Ubisoft, Singapore (and 1 more)
- Thanh Nguyen 0004
![[0000-0001-9709-1663]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-9709-1663")
(aka: Thanh Thi Nguyen 0001) — Deakin University, Waurn Ponds, Victoria, Australia (and 1 more) - Thanh Nguyen 0005 (aka: Thanh Minh Nguyen 0002) — University of Alabama at Birmingham, AL, USA (and 1 more)
- Thanh Nguyen 0006 — The Catholic University of America, Electrical Engineering and Computer Science Department, Washington, DC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i6]Thành Nguyen, Alexander Teytelboym, Shai Vardi:
Dynamic Combinatorial Assignment. CoRR abs/2303.13967 (2023)- 2022
- [j12]Young-San Lin, Hai Nguyen, Thành Nguyen, Kemal Altinkemer:
Allocation with Weak Priorities and General Constraints. Oper. Res. 70(5): 2804-2819 (2022) - 2021
- [j11]Hai Nguyen, Thành Nguyen, Alexander Teytelboym:
Stability in Matching Markets with Complex Constraints. Manag. Sci. 67(12): 7438-7454 (2021) - [c19]Melina Muthuswamy, Randall Berry, Michael L. Honig, Thành Nguyen, Vijay G. Subramanian, Rakesh Vohra:
Spectrum Pooling with Competitive Service Providers. DySPAN 2021: 169-176 - [c18]Young-San Lin, Hai Nguyen, Thành Nguyen, Kemal Altinkemer:
Allocation with Weak Priorities and General Constraints. EC 2021: 690-691 - [c17]Thành Nguyen, Rakesh Vohra:
Δ-Substitute Preferences and Equilibria with Indivisibilities. EC 2021: 735-736 - 2020
- [j10]Randall Berry, Michael L. Honig, Thành Nguyen, Vijay G. Subramanian, Rakesh Vohra:
The Value of Sharing Intermittent Spectrum. Manag. Sci. 66(11): 5242-5264 (2020) - [c16]Tao Jiang, Young-San Lin, Thành Nguyen:
Market Equilibrium in Multi-tier Supply Chain Networks. WINE 2020: 467 - [i5]Tao Jiang, Young-San Lin, Thanh Nguyen:
Market Equilibrium in Multi-tier Supply Chain Networks. CoRR abs/2009.13021 (2020)
2010 – 2019
- 2019
- [j9]Thành Nguyen, Rakesh Vohra:
Stable Matching with Proportionality Constraints. Oper. Res. 67(6): 1503-1519 (2019) - [c15]Thành Nguyen, Hai Nguyen, Alexander Teytelboym:
Stability in Matching Markets with Complex Constraints. EC 2019: 61 - 2017
- [j8]Thành Nguyen:
Technical Note - Local Bargaining and Supply Chain Instability. Oper. Res. 65(6): 1535-1545 (2017) - [c14]Thành Nguyen, Rakesh Vohra:
Stable Matching with Proportionality Constraints. EC 2017: 675-676 - [c13]Young-San Lin, Thanh Nguyen:
On Variants of Network Flow Stability. WINE 2017: 403-404 - [i4]Randall Berry, Michael L. Honig, Thành Nguyen, Vijay G. Subramanian, Rakesh V. Vohra:
The Value of Sharing Intermittent Spectrum. CoRR abs/1704.06828 (2017) - [i3]Young-San Lin, Thanh Nguyen:
On Variants of Network Flow Stability. CoRR abs/1710.03091 (2017) - 2016
- [j7]Thành Nguyen, Vijay G. Subramanian, Randall Berry:
Delay in Trade Networks. Oper. Res. 64(3): 646-661 (2016) - [j6]Thành Nguyen, Hang Zhou, Randall A. Berry, Michael L. Honig, Rakesh Vohra:
The Cost of Free Spectrum. Oper. Res. 64(6): 1217-1229 (2016) - [j5]Thành Nguyen, Ahmad Peivandi, Rakesh Vohra:
Assignment problems with complementarities. J. Econ. Theory 165: 209-241 (2016) - 2015
- [c12]Thanh Nguyen, Rakesh Vohra:
Near Feasible Stable Matchings. EC 2015: 41-42 - [i2]Thành Nguyen, Hang Zhou, Randall A. Berry, Michael L. Honig, Rakesh V. Vohra:
The Cost of Free Spectrum. CoRR abs/1507.07888 (2015) - 2013
- [j4]Thành Nguyen:
A simple LP relaxation for the asymmetric traveling salesman problem. Math. Program. 141(1-2): 549-559 (2013) - [c11]Thành Nguyen, Vijay G. Subramanian, Randall Berry:
Searching and bargaining with middlemen. Allerton 2013: 397 - [c10]Randall Berry, Michael L. Honig, Vijay G. Subramanian, Thành Nguyen, Rakesh Vohra:
Market structures for wireless services with shared spectrum. Allerton 2013: 1188-1191 - [c9]Randall Berry, Michael L. Honig, Thành Nguyen, Vijay G. Subramanian, Hang Zhou, Rakesh Vohra:
On the nature of revenue-sharing contracts to incentivize spectrum-sharing. INFOCOM 2013: 845-853 - [i1]Randall A. Berry, Thành Nguyen, Vijay G. Subramanian:
Bargaining with Middlemen. CoRR abs/1302.2869 (2013) - 2012
- [j3]Thành Nguyen:
Non-cooperative bargaining dynamics in trading networks. SIGecom Exch. 11(2): 32-35 (2012) - [j2]Randall Berry, Michael L. Honig, Thành Nguyen, Vijay G. Subramanian, Hang Zhou, Rakesh Vohra:
Newsvendor model of capacity sharing. SIGMETRICS Perform. Evaluation Rev. 40(2): 26-29 (2012) - [c8]Thành Nguyen:
Coalitional bargaining in networks. EC 2012: 772 - [c7]Thành Nguyen:
Local bargaining and endogenous fluctuations. EC 2012: 773 - 2011
- [c6]Thành Nguyen:
Revenue Maximization via Nash Implementation. ICS 2011: 112-124 - [c5]Thành Nguyen, Milan Vojnovic:
Weighted proportional allocation. SIGMETRICS 2011: 173-184
2000 – 2009
- 2009
- [c4]Thành Nguyen, Éva Tardos:
Approximate Pure Nash Equilibria via Lovász Local Lemma. WINE 2009: 160-171 - 2008
- [c3]Thành Nguyen:
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem. APPROX-RANDOM 2008: 207-218 - [c2]Thành Nguyen, Éva Tardos:
Parallel Imaging Problem. ESA 2008: 684-695 - 2007
- [j1]Thành Nguyen:
On the disjoint paths problem. Oper. Res. Lett. 35(1): 10-16 (2007) - [c1]Thành Nguyen, Éva Tardos:
Approximately maximizing efficiency and revenue in polyhedral environments. EC 2007: 11-19
Coauthor Index
aka: Rakesh Vohra
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-04-21 16:59 CEST 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:
