Tien Mai

CoRR, February, 2026

Constrained assortment optimization under the mixed-Logit model: Approximation schemes and outer approximation approaches.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2026

2025

Preference-Guided Learning for Sparse-Reward Multi-Agent Reinforcement Learning.

[BibT_eX]

[DOI]

CoRR, September, 2025

An exponential cone integer programming and piece-wise linear approximation approach for 0-1 fractional programming.

[BibT_eX]

[DOI]

J. Comb. Optim., July, 2025

Learning What to Do and What Not To Do: Offline Imitation from Expert and Undesirable Demonstrations.

[BibT_eX]

[DOI]

CoRR, May, 2025

MisoDICE: Multi-Agent Imitation from Unlabeled Mixed-Quality Demonstrations.

[BibT_eX]

[DOI]

CoRR, May, 2025

MisoDICE: Multi-Agent Imitation from Mixed-Quality Demonstrations.

[BibT_eX]

[DOI]

Tien Anh Mai

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

O-MAPL: Offline Multi-agent Preference Learning.

[BibT_eX]

[DOI]

Proceedings of the Forty-second International Conference on Machine Learning, 2025

ComaDICE: Offline Cooperative Multi-Agent Reinforcement Learning with Stationary Distribution Shift Regularization.

[BibT_eX]

[DOI]

Tien Anh Mai

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024

UNIQ: Offline Inverse Q-learning for Avoiding Undesirable Demonstrations.

[BibT_eX]

[DOI]

CoRR, 2024

Outer Approximation and Super-modular Cuts for Constrained Assortment Optimization under Mixed-Logit Model.

[BibT_eX]

[DOI]

CoRR, 2024

Competitive Facility Location under Random Utilities and Routing Constraints.

[BibT_eX]

[DOI]

CoRR, 2024

SubIQ: Inverse Soft-Q Learning for Offline Imitation with Suboptimal Demonstrations.

[BibT_eX]

[DOI]

CoRR, 2024

SPRINQL: Sub-optimal Demonstrations driven Offline Imitation Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Mimicking To Dominate: Imitation Learning Strategies for Success in Multiagent Games.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Inverse Factorized Soft Q-Learning for Cooperative Multi-agent Imitation Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Tackling Stackelberg Network Interdiction against a Boundedly Rational Adversary.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Reward Penalties on Augmented States for Solving Richly Constrained RL Effectively.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Imitate the Good and Avoid the Bad: An Incremental Approach to Safe Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Robust maximum capture facility location under random utility maximization models.

[BibT_eX]

[DOI]

Tien Thanh Dam

Eur. J. Oper. Res., November, 2023

Joint location and cost planning in maximum capture facility location under random utilities.

[BibT_eX]

[DOI]

Comput. Oper. Res., November, 2023

Inverse Factorized Q-Learning for Cooperative Multi-agent Imitation Learning.

[BibT_eX]

[DOI]

CoRR, 2023

Mimicking To Dominate: Imitation Learning Strategies for Success in Multiagent Competitive Games.

[BibT_eX]

[DOI]

CoRR, 2023

Tackling Stackelberg Network Interdiction against a Boundedly Rational Adversary.

[BibT_eX]

[DOI]

CoRR, 2023

Solving Constrained Reinforcement Learning through Augmented State and Reward Penalties.

[BibT_eX]

[DOI]

Hao Jiang

CoRR, 2023

Imitating Opponent to Win: Adversarial Policy Imitation Learning in Two-player Competitive Games.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Imitation Improvement Learning for Large-Scale Capacitated Vehicle Routing Problems.

[BibT_eX]

[DOI]

Viet The Bui

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Securing Lifelines: Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

A Fair Incentive Scheme for Community Health Workers.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Undiscounted Recursive Path Choice Models: Convergence Properties and Algorithms.

[BibT_eX]

[DOI]

Emma Frejinger

Transp. Sci., 2022

Joint chance-constrained staffing optimization in multi-skill call centers.

[BibT_eX]

[DOI]

Tien Thanh Dam

J. Comb. Optim., 2022

Submodularity and local search approaches for maximum capture problems under generalized extreme value models.

[BibT_eX]

[DOI]

Tien Thanh Dam

Eur. J. Oper. Res., 2022

Weighted Maximum Entropy Inverse Reinforcement Learning.

[BibT_eX]

[DOI]

CoRR, 2022

Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach.

[BibT_eX]

[DOI]

CoRR, 2022

A Logistic Regression and Linear Programming Approach for Multi-Skill Staffing Optimization in Call Centers.

[BibT_eX]

[DOI]

Proceedings of the Winter Simulation Conference, 2022

Scalable Distributional Robustness in a Class of Non-Convex Optimization with Guarantees.

[BibT_eX]

[DOI]

Avinandan Bose

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Choices Are Not Independent: Stackelberg Security Games with Nested Quantal Response Models.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling.

[BibT_eX]

[DOI]

Math. Program., 2021

Robust Entropy-regularized Markov Decision Processes.

[BibT_eX]

[DOI]

CoRR, 2021

2020

A multicut outer-approximation approach for competitive facility location under random utilities.

[BibT_eX]

[DOI]

Andrea Lodi

Eur. J. Oper. Res., 2020

A Relation Analysis of Markov Decision Process Frameworks.

[BibT_eX]

[DOI]

CoRR, 2020

Modeling Route Choice with Real-Time Information: Comparing the Recursive and Non-Recursive Models.

[BibT_eX]

[DOI]

CoRR, 2020

Simulating and Evaluating Rebalancing Strategies for Dockless Bike-Sharing Systems.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Robust Multi-product Pricing under General Extreme Value Models.

[BibT_eX]

[DOI]

CoRR, 2019

Inverse Reinforcement Learning with Missing Data.

[BibT_eX]

[DOI]

CoRR, 2019

Generalized Maximum Causal Entropy for Inverse Reinforcement Learning.

[BibT_eX]

[DOI]

Kennard Chan

CoRR, 2019

2018

A decomposition method for estimating recursive logit based route choice models.

[BibT_eX]

[DOI]