default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTien Mai
Person information
- affiliation: Singapore Management University, School of Computing and Information Systems, Singapore
- affiliation: Singapore-MIT Alliance for Research and Technology, Singapore
- affiliation (PhD 2016): Polytechnique Montréal, Department of Mathematical and Industrial Engineering, Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j11]Hoang Giang Pham
, Tien Mai:
Constrained assortment optimization under the mixed-Logit model: Approximation schemes and outer approximation approaches. Eur. J. Oper. Res. 332(1): 257-275 (2026)- [j10]Dinh Quy Ta, Thu Huong Dang, Minh Hoàng Hà, Duc Minh Vu, Tien Mai:
The rescheduling school bus routing problem under a constraint on the number of students with negative impact. J. Oper. Res. Soc. 77(4): 1130-1149 (2026) - [i26]Hoang Giang Pham, Tien Mai:
Constrained Pricing under Finite Mixtures of Logit. CoRR abs/2602.08119 (2026) - 2025
- [j9]Hoang Giang Pham, Thuy Anh Ta, Tien Mai:
An exponential cone integer programming and piece-wise linear approximation approach for 0-1 fractional programming. J. Comb. Optim. 49(5): 85 (2025) - [c16]The Viet Bui, Thanh Hong Nguyen, Tien Anh Mai:
ComaDICE: Offline Cooperative Multi-Agent Reinforcement Learning with Stationary Distribution Shift Regularization. ICLR 2025 - [c15]The Viet Bui, Tien Mai, Thanh Hong Nguyen:
O-MAPL: Offline Multi-agent Preference Learning. ICML 2025 - [c14]The Viet Bui, Tien Anh Mai, Thanh Hong Nguyen:
MisoDICE: Multi-Agent Imitation from Mixed-Quality Demonstrations. NeurIPS 2025 - [i25]The Viet Bui, Tien Mai, Thanh Hong Nguyen:
O-MAPL: Offline Multi-agent Preference Learning. CoRR abs/2501.18944 (2025) - [i24]The Viet Bui, Tien Mai, Thanh Hong Nguyen:
MisoDICE: Multi-Agent Imitation from Unlabeled Mixed-Quality Demonstrations. CoRR abs/2505.18595 (2025) - [i23]Huy Hoang, Tien Mai, Pradeep Varakantham, Tanvi Verma:
Learning What to Do and What Not To Do: Offline Imitation from Expert and Undesirable Demonstrations. CoRR abs/2505.21182 (2025) - [i22]The Viet Bui, Tien Mai, Thanh Hong Nguyen:
Preference-Guided Learning for Sparse-Reward Multi-Agent Reinforcement Learning. CoRR abs/2509.21828 (2025) - 2024
- [c13]Huy Hoang, Tien Mai, Pradeep Varakantham:
Imitate the Good and Avoid the Bad: An Incremental Approach to Safe Reinforcement Learning. AAAI 2024: 12439-12447 - [c12]Hao Jiang, Tien Mai, Pradeep Varakantham, Huy Hoang:
Reward Penalties on Augmented States for Solving Richly Constrained RL Effectively. AAAI 2024: 19867-19875 - [c11]Tien Mai, Avinandan Bose, Arunesh Sinha, Thanh Hong Nguyen, Ayushman Kumar Singh:
Tackling Stackelberg Network Interdiction against a Boundedly Rational Adversary. IJCAI 2024: 2913-2921 - [c10]The Viet Bui, Tien Mai, Thanh Hong Nguyen:
Inverse Factorized Soft Q-Learning for Cooperative Multi-agent Imitation Learning. NeurIPS 2024 - [c9]The Viet Bui, Tien Mai, Thanh Hong Nguyen:
Mimicking To Dominate: Imitation Learning Strategies for Success in Multiagent Games. NeurIPS 2024 - [c8]Huy Hoang, Tien Mai, Pradeep Varakantham:
SPRINQL: Sub-optimal Demonstrations driven Offline Imitation Learning. NeurIPS 2024 - [i21]Huy Hoang, Tien Mai, Pradeep Varakantham:
SubIQ: Inverse Soft-Q Learning for Offline Imitation with Suboptimal Demonstrations. CoRR abs/2402.13147 (2024) - [i20]Hoang Giang Pham, Tien Thanh Dam, Ngan Ha Duong, Tien Mai, Minh Hoàng Hà:
Competitive Facility Location under Random Utilities and Routing Constraints. CoRR abs/2403.04264 (2024) - [i19]Hoang Giang Pham, Tien Mai:
Outer Approximation and Super-modular Cuts for Constrained Assortment Optimization under Mixed-Logit Model. CoRR abs/2407.18532 (2024) - [i18]The Viet Bui, Thanh Hong Nguyen, Tien Mai:
ComaDICE: Offline Cooperative Multi-Agent Reinforcement Learning with Stationary Distribution Shift Regularization. CoRR abs/2410.01954 (2024) - [i17]Huy Hoang, Tien Mai, Pradeep Varakantham:
UNIQ: Offline Inverse Q-learning for Avoiding Undesirable Demonstrations. CoRR abs/2410.08307 (2024) - 2023
- [j8]Ngan Ha Duong, Tien Thanh Dam, Thuy Anh Ta, Tien Mai:
Joint location and cost planning in maximum capture facility location under random utilities. Comput. Oper. Res. 159: 106336 (2023) - [j7]Tien Thanh Dam, Thuy Anh Ta, Tien Mai:
Robust maximum capture facility location under random utility maximization models. Eur. J. Oper. Res. 310(3): 1128-1150 (2023) - [c7]Tien Mai, Arunesh Sinha:
Securing Lifelines: Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach. AAAI 2023: 5805-5813 - [c6]Avinandan Bose, Tracey Li, Arunesh Sinha, Tien Mai:
A Fair Incentive Scheme for Community Health Workers. AAAI 2023: 14127-14135 - [c5]Viet The Bui, Tien Mai:
Imitation Improvement Learning for Large-Scale Capacitated Vehicle Routing Problems. ICAPS 2023: 551-559 - [c4]The Viet Bui, Tien Mai, Thanh Hong Nguyen:
Imitating Opponent to Win: Adversarial Policy Imitation Learning in Two-player Competitive Games. AAMAS 2023: 1285-1293 - [i16]Hao Jiang, Tien Mai, Pradeep Varakantham:
Solving Constrained Reinforcement Learning through Augmented State and Reward Penalties. CoRR abs/2301.11592 (2023) - [i15]Tien Mai, Avinandan Bose, Arunesh Sinha, Thanh Hong Nguyen:
Tackling Stackelberg Network Interdiction against a Boundedly Rational Adversary. CoRR abs/2301.12232 (2023) - [i14]The Viet Bui, Tien Mai, Thanh Hong Nguyen:
Mimicking To Dominate: Imitation Learning Strategies for Success in Multiagent Competitive Games. CoRR abs/2308.10188 (2023) - [i13]The Viet Bui, Tien Mai, Thanh Hong Nguyen:
Inverse Factorized Q-Learning for Cooperative Multi-agent Imitation Learning. CoRR abs/2310.06801 (2023) - [i12]Huy Hoang, Tien Mai, Pradeep Varakantham:
Imitate the Good and Avoid the Bad: An Incremental Approach to Safe Reinforcement Learning. CoRR abs/2312.10385 (2023) - 2022
- [j6]Tien Thanh Dam, Thuy Anh Ta, Tien Mai:
Submodularity and local search approaches for maximum capture problems under generalized extreme value models. Eur. J. Oper. Res. 300(3): 953-965 (2022) - [j5]Tien Thanh Dam, Thuy Anh Ta, Tien Mai:
Joint chance-constrained staffing optimization in multi-skill call centers. J. Comb. Optim. 44(1): 354-378 (2022) - [j4]Tien Mai, Emma Frejinger:
Undiscounted Recursive Path Choice Models: Convergence Properties and Algorithms. Transp. Sci. 56(6): 1469-1482 (2022) - [c3]Tien Mai, Arunesh Sinha:
Choices Are Not Independent: Stackelberg Security Games with Nested Quantal Response Models. AAAI 2022: 5141-5149 - [c2]Avinandan Bose, Arunesh Sinha, Tien Mai:
Scalable Distributional Robustness in a Class of Non-Convex Optimization with Guarantees. NeurIPS 2022 - [c1]Thuy Anh Ta, Tien Mai, Fabian Bastin, Pierre L'Ecuyer:
A Logistic Regression and Linear Programming Approach for Multi-Skill Staffing Optimization in Call Centers. WSC 2022: 3087-3098 - [i11]Tien Mai, Arunesh Sinha:
Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach. CoRR abs/2204.11451 (2022) - [i10]Avinandan Bose, Arunesh Sinha, Tien Mai:
Scalable Distributional Robustness in a Class of Non Convex Optimization with Guarantees. CoRR abs/2205.15624 (2022) - [i9]The Viet Bui, Tien Mai, Patrick Jaillet:
Weighted Maximum Entropy Inverse Reinforcement Learning. CoRR abs/2208.09611 (2022) - [i8]The Viet Bui, Tien Mai, Thanh Hong Nguyen:
Imitating Opponent to Win: Adversarial Policy Imitation Learning in Two-player Competitive Games. CoRR abs/2210.16915 (2022) - 2021
- [j3]Thuy Anh Ta, Tien Mai, Fabian Bastin, Pierre L'Ecuyer:
On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling. Math. Program. 190(1): 1-37 (2021) - [i7]Tien Mai, Patrick Jaillet:
Robust Entropy-regularized Markov Decision Processes. CoRR abs/2112.15364 (2021) - 2020
- [j2]Tien Mai, Andrea Lodi:
A multicut outer-approximation approach for competitive facility location under random utilities. Eur. J. Oper. Res. 284(3): 874-881 (2020) - [i6]Damian Barabonkov, Samantha D'Alonzo, Joseph Pierre, Dániel Kondor, Xiaohu Zhang, Mai Anh Tien:
Simulating and Evaluating Rebalancing Strategies for Dockless Bike-Sharing Systems. CoRR abs/2004.11565 (2020) - [i5]Xinlian Yu, Tien Mai, Jing Ding-Mastera, Song Gao, Emma Frejinger:
Modeling Route Choice with Real-Time Information: Comparing the Recursive and Non-Recursive Models. CoRR abs/2005.05783 (2020) - [i4]Tien Mai, Patrick Jaillet:
A Relation Analysis of Markov Decision Process Frameworks. CoRR abs/2008.07820 (2020)
2010 – 2019
- 2019
- [i3]Tien Mai, Kennard Chan, Patrick Jaillet:
Generalized Maximum Causal Entropy for Inverse Reinforcement Learning. CoRR abs/1911.06928 (2019) - [i2]Tien Mai, Quoc Phong Nguyen, Kian Hsiang Low, Patrick Jaillet:
Inverse Reinforcement Learning with Missing Data. CoRR abs/1911.06930 (2019) - [i1]Tien Mai, Patrick Jaillet:
Robust Multi-product Pricing under General Extreme Value Models. CoRR abs/1912.09552 (2019) - 2018
- [j1]Tien Mai, Fabian Bastin, Emma Frejinger:
A decomposition method for estimating recursive logit based route choice models. EURO J. Transp. Logist. 7(3): 253-275 (2018)
Coauthor Index
aka: The Viet Bui
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 2026-07-11 00:48 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
