A decomposition method for estimating recursive logit based route choice models. - Tien Mai; Fabian Bastin; Emma Frejinger (EURO J. Transp. Logist., 2018)

Generalized Maximum Causal Entropy for Inverse Reinforcement Learning. - Tien Mai; Kennard Chan; Patrick Jaillet (CoRR, 2019)

Inverse Reinforcement Learning with Missing Data. - Tien Mai; Quoc Phong Nguyen; Kian Hsiang Low; Patrick Jaillet (CoRR, 2019)

Robust Multi-product Pricing under General Extreme Value Models. - Tien Mai; Patrick Jaillet (CoRR, 2019)

Modeling Route Choice with Real-Time Information: Comparing the Recursive and Non-Recursive Models. - Xinlian Yu; Tien Mai; Jing Ding-Mastera; Song Gao; Emma Frejinger (CoRR, 2020)

A Relation Analysis of Markov Decision Process Frameworks. - Tien Mai; Patrick Jaillet (CoRR, 2020)

A multicut outer-approximation approach for competitive facility location under random utilities. - Tien Mai; Andrea Lodi 001 (Eur. J. Oper. Res., 2020)

Robust Entropy-regularized Markov Decision Processes. - Tien Mai; Patrick Jaillet (CoRR, 2021)

On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling. - Thuy Anh Ta; Tien Mai; Fabian Bastin; Pierre L'Ecuyer (Math. Program., 2021)

Choices Are Not Independent: Stackelberg Security Games with Nested Quantal Response Models. - Tien Mai; Arunesh Sinha (AAAI, 2022)

Scalable Distributional Robustness in a Class of Non-Convex Optimization with Guarantees. - Avinandan Bose; Arunesh Sinha; Tien Mai (NeurIPS, 2022)

A Logistic Regression and Linear Programming Approach for Multi-Skill Staffing Optimization in Call Centers. - Thuy Anh Ta; Tien Mai; Fabian Bastin; Pierre L'Ecuyer (WSC, 2022)

Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach. - Tien Mai; Arunesh Sinha (CoRR, 2022)

Weighted Maximum Entropy Inverse Reinforcement Learning. - The Viet Bui; Tien Mai; Patrick Jaillet (CoRR, 2022)

Submodularity and local search approaches for maximum capture problems under generalized extreme value models. - Tien Thanh Dam; Thuy Anh Ta; Tien Mai (Eur. J. Oper. Res., 2022)

Joint chance-constrained staffing optimization in multi-skill call centers. - Tien Thanh Dam; Thuy Anh Ta; Tien Mai (J. Comb. Optim., 2022)

Undiscounted Recursive Path Choice Models: Convergence Properties and Algorithms. - Tien Mai; Emma Frejinger (Transp. Sci., 2022)

A Fair Incentive Scheme for Community Health Workers. - Avinandan Bose; Tracey Li; Arunesh Sinha; Tien Mai (AAAI, 2023)

Securing Lifelines: Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach. - Tien Mai; Arunesh Sinha (AAAI, 2023)

Imitation Improvement Learning for Large-Scale Capacitated Vehicle Routing Problems. - Viet The Bui; Tien Mai (ICAPS, 2023)

Imitating Opponent to Win: Adversarial Policy Imitation Learning in Two-player Competitive Games. - The Viet Bui; Tien Mai; Thanh Hong Nguyen (AAMAS, 2023)

Solving Constrained Reinforcement Learning through Augmented State and Reward Penalties. - Hao Jiang; Tien Mai; Pradeep Varakantham (CoRR, 2023)

Tackling Stackelberg Network Interdiction against a Boundedly Rational Adversary. - Tien Mai; Avinandan Bose; Arunesh Sinha; Thanh Hong Nguyen (CoRR, 2023)

Mimicking To Dominate: Imitation Learning Strategies for Success in Multiagent Competitive Games. - The Viet Bui; Tien Mai; Thanh Hong Nguyen (CoRR, 2023)

Inverse Factorized Q-Learning for Cooperative Multi-agent Imitation Learning. - The Viet Bui; Tien Mai; Thanh Hong Nguyen (CoRR, 2023)

Joint location and cost planning in maximum capture facility location under random utilities. - Ngan Ha Duong; Tien Thanh Dam; Thuy Anh Ta; Tien Mai (Comput. Oper. Res., 2023)

Robust maximum capture facility location under random utility maximization models. - Tien Thanh Dam; Thuy Anh Ta; Tien Mai (Eur. J. Oper. Res., 2023)

Imitate the Good and Avoid the Bad: An Incremental Approach to Safe Reinforcement Learning. - Huy Hoang; Tien Mai; Pradeep Varakantham (AAAI, 2024)

Reward Penalties on Augmented States for Solving Richly Constrained RL Effectively. - Hao Jiang; Tien Mai; Pradeep Varakantham; Huy Hoang (AAAI, 2024)

Tackling Stackelberg Network Interdiction against a Boundedly Rational Adversary. - Tien Mai; Avinandan Bose; Arunesh Sinha; Thanh Hong Nguyen; Ayushman Kumar singh (IJCAI, 2024)

Inverse Factorized Soft Q-Learning for Cooperative Multi-agent Imitation Learning. - The Viet Bui; Tien Mai; Thanh Hong Nguyen (NeurIPS, 2024)

Mimicking To Dominate: Imitation Learning Strategies for Success in Multiagent Games. - The Viet Bui; Tien Mai; Thanh Hong Nguyen (NeurIPS, 2024)

SPRINQL: Sub-optimal Demonstrations driven Offline Imitation Learning. - Huy Hoang; Tien Mai; Pradeep Varakantham (NeurIPS, 2024)

SubIQ: Inverse Soft-Q Learning for Offline Imitation with Suboptimal Demonstrations. - Huy Hoang; Tien Mai; Pradeep Varakantham (CoRR, 2024)

Competitive Facility Location under Random Utilities and Routing Constraints. - Hoang Giang Pham; Tien Thanh Dam; Ngan Ha Duong; Tien Mai; Minh Hoàng Hà (CoRR, 2024)

Outer Approximation and Super-modular Cuts for Constrained Assortment Optimization under Mixed-Logit Model. - Hoang Giang Pham; Tien Mai (CoRR, 2024)

UNIQ: Offline Inverse Q-learning for Avoiding Undesirable Demonstrations. - Huy Hoang; Tien Mai; Pradeep Varakantham (CoRR, 2024)

ComaDICE: Offline Cooperative Multi-Agent Reinforcement Learning with Stationary Distribution Shift Regularization. - The Viet Bui; Thanh Hong Nguyen; Tien Mai (ICLR, 2025)

O-MAPL: Offline Multi-agent Preference Learning. - The Viet Bui; Tien Mai; Thanh Hong Nguyen (CoRR, 2025)

MisoDICE: Multi-Agent Imitation from Unlabeled Mixed-Quality Demonstrations. - The Viet Bui; Tien Mai; Thanh Hong Nguyen (CoRR, 2025)

Learning What to Do and What Not To Do: Offline Imitation from Expert and Undesirable Demonstrations. - Huy Hoang; Tien Mai; Pradeep Varakantham; Tanvi Verma (CoRR, 2025)

An exponential cone integer programming and piece-wise linear approximation approach for 0-1 fractional programming. - Hoang Giang Pham; Thuy Anh Ta; Tien Mai (J. Comb. Optim., 2025)