![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Tri-Dung Nguyen
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Tri-Dung Nguyen
:
Game of banks - biform game theoretical framework for ATM network cost sharing. Eur. J. Oper. Res. 316(3): 1158-1178 (2024) - 2023
- [i3]Le Cong Dinh, Tri-Dung Nguyen, Alain B. Zemkoho, Long Tran-Thanh:
Achieving Better Regret against Strategic Adversaries. CoRR abs/2302.06652 (2023) - 2021
- [j18]Fei Fang, Tri-Dung Nguyen
, Christine S. M. Currie
:
Joint pricing and inventory decisions for substitutable and perishable products under demand uncertainty. Eur. J. Oper. Res. 293(2): 594-602 (2021) - [j17]Márton Benedek
, Jörg Fliege
, Tri-Dung Nguyen
:
Finding and verifying the nucleolus of cooperative games. Math. Program. 190(1): 135-170 (2021) - [c5]Le Cong Dinh, Tri-Dung Nguyen, Alain B. Zemkoho, Long Tran-Thanh:
Last Round Convergence and No-Dynamic Regret in Asymmetric Repeated Games. ALT 2021: 553-577 - 2020
- [j16]Phuoc Hoang Le, Tri-Dung Nguyen
, Tolga Bektas
:
Efficient computation of the Shapley value for large-scale linear production games. Ann. Oper. Res. 287(2): 761-781 (2020) - [j15]Arash Gourtani, Tri-Dung Nguyen
, Huifu Xu:
A distributionally robust optimization approach for two-stage facility location problems. EURO J. Comput. Optim. 8(2): 141-172 (2020) - [j14]Xuan Vinh Doan
, Tri-Dung Nguyen
:
Technical Note - Robust Newsvendor Games with Ambiguity in Demand Distributions. Oper. Res. 68(4): 1047-1062 (2020) - [i2]Le Cong Dinh, Long Tran-Thanh, Tri-Dung Nguyen, Alain B. Zemkoho:
Last Round Convergence and No-Instant Regret in Repeated Games with Asymmetric Information. CoRR abs/2003.11727 (2020)
2010 – 2019
- 2018
- [j13]Shahin Abbaszadeh, Tri-Dung Nguyen
, Yue Wu:
Optimal trading under non-negativity constraints using approximate dynamic programming. J. Oper. Res. Soc. 69(9): 1406-1422 (2018) - 2017
- [j12]George Zioutas, Christos Chatzinakos, Tri-Dung Nguyen
, Leonidas S. Pitsoulis:
Optimization techniques for multivariate least trimmed absolute deviation estimation. J. Comb. Optim. 34(3): 781-797 (2017) - 2016
- [j11]Phuoc Hoang Le, Tri-Dung Nguyen
, Tolga Bektas
:
Generalized minimum spanning tree games. EURO J. Comput. Optim. 4(2): 167-188 (2016) - [j10]Tri-Dung Nguyen
, Lyn Thomas:
Finding the nucleoli of large cooperative games. Eur. J. Oper. Res. 248(3): 1078-1092 (2016) - [j9]Tri-Dung Nguyen, Lyn Thomas:
Corrigendum to "Finding the nucleoli of large cooperative games" [European Journal of Operational Research 248 (2016) 1078-1092]. Eur. J. Oper. Res. 254(2): 689 (2016) - [j8]Tri-Dung Nguyen, Ximing Cai
, Yanfeng Ouyang, Mashor Housh:
Modelling infrastructure interdependencies, resiliency and sustainability. Int. J. Crit. Infrastructures 12(1/2): 4-36 (2016) - [j7]Arash Gourtani, Huifu Xu
, David Pozo
, Tri-Dung Nguyen
:
Robust unit commitment with \(n-1\) security criteria. Math. Methods Oper. Res. 83(3): 373-408 (2016) - [c4]Tri-Dung Nguyen, Tuomas Sandholm:
Multi-Option Descending Clock Auction: (Extended Abstract). AAMAS 2016: 1461-1462 - 2015
- [j6]Tri-Dung Nguyen
:
The fairest core in cooperative games with transferable utilities. Oper. Res. Lett. 43(1): 34-39 (2015) - 2014
- [j5]Tri-Dung Nguyen
:
A fast approximation algorithm for solving the complete set packing problem. Eur. J. Oper. Res. 237(1): 62-70 (2014) - [j4]Florian M. Biermann, Victor Naroditskiy, Maria Polukarov, Tri-Dung Nguyen, Alex Rogers, Nicholas R. Jennings
:
Task assignment with controlled and autonomous agents. Math. Soc. Sci. 71: 116-121 (2014) - [c3]Tri-Dung Nguyen
, Tuomas Sandholm:
Optimizing prices in descending clock auctions. EC 2014: 93-110 - [i1]Xuan Vinh Doan, Tri-Dung Nguyen:
Robust Stable Payoff Distribution in Stochastic Cooperative Games. CoRR abs/1403.5906 (2014) - 2013
- [c2]Talal Rahwan, Tri-Dung Nguyen, Tomasz P. Michalak, Maria Polukarov, Madalina Croitoru, Nicholas R. Jennings:
Coalitional Games via Network Flows. IJCAI 2013: 324-331 - [c1]Long Tran-Thanh, Tri-Dung Nguyen, Talal Rahwan, Alex Rogers, Nicholas R. Jennings:
An Efficient Vector-Based Representation for Coalitional Games. IJCAI 2013: 383-389 - 2012
- [j3]Tri-Dung Nguyen
, Andrew W. Lo:
Robust ranking and portfolio optimization. Eur. J. Oper. Res. 221(2): 407-416 (2012) - 2010
- [j2]Tri-Dung Nguyen
, Roy E. Welsch:
Outlier detection and robust covariance estimation using mathematical programming. Adv. Data Anal. Classif. 4(4): 301-334 (2010) - [j1]Tri-Dung Nguyen
, Roy E. Welsch:
Outlier detection and least trimmed squares approximation using semi-definite programming. Comput. Stat. Data Anal. 54(12): 3212-3226 (2010)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-05 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint