pith. sign in

Tien Mai

Identifiers

  • name variant Tien Mai 0.60 · backfill

Papers (34)

  1. Constrained Recursive Logit for Route Choice Analysis econ.EM · 2025 · author #2
  2. On the Estimation of Multinomial Logit and Nested Logit Models: A Conic Optimization Approach econ.EM · 2025 · author #2
  3. Learning What to Do and What Not To Do: Offline Imitation from Expert and Undesirable Demonstrations cs.LG · 2025 · author #2
  4. MisoDICE: Multi-Agent Imitation from Unlabeled Mixed-Quality Demonstrations cs.LG · 2025 · author #2
  5. O-MAPL: Offline Multi-agent Preference Learning cs.LG · 2025 · author #2
  6. Constrained Pricing in Choice-based Revenue Management math.OC · 2025 · author #2
  7. Competitive Facility Location with Market Expansion and Customer-centric Objective math.OC · 2024 · author #2
  8. UNIQ: Offline Inverse Q-learning for Avoiding Undesirable Demonstrations cs.LG · 2024 · author #2
  9. ComaDICE: Offline Cooperative Multi-Agent Reinforcement Learning with Stationary Distribution Shift Regularization cs.LG · 2024 · author #3
  10. Competitive Facility Location under Cross-Nested Logit Customer Choice Model: Hardness and Exact Approaches math.OC · 2024 · author #2
  11. Outer Approximation and Super-modular Cuts for Constrained Assortment Optimization under Mixed-Logit Model math.OC · 2024 · author #2
  12. Competitive Facility Location under Random Utilities and Routing Constraints cs.AI · 2024 · author #4
  13. SPRINQL: Sub-optimal Demonstrations driven Offline Imitation Learning cs.LG · 2024 · author #2
  14. Imitate the Good and Avoid the Bad: An Incremental Approach to Safe Reinforcement Learning cs.LG · 2023 · author #2
  15. Inverse Factorized Q-Learning for Cooperative Multi-agent Imitation Learning cs.LG · 2023 · author #2
  16. Mimicking To Dominate: Imitation Learning Strategies for Success in Multiagent Competitive Games cs.LG · 2023 · author #2
  17. Network-based Representations and Dynamic Discrete Choice Models for Multiple Discrete Choice Analysis econ.EM · 2023 · author #2
  18. Constrained Assortment Optimization under the Cross-Nested Logit Model math.OC · 2023 · author #2
  19. Tackling Stackelberg Network Interdiction against a Boundedly Rational Adversary math.OC · 2023 · author #1
  20. Solving Richly Constrained Reinforcement Learning through State Augmentation and Reward Penalties cs.LG · 2023 · author #2
  21. Imitating Opponent to Win: Adversarial Policy Imitation Learning in Two-player Competitive Games cs.LG · 2022 · author #2
  22. Weighted Maximum Entropy Inverse Reinforcement Learning cs.LG · 2022 · author #2
  23. Scalable Distributional Robustness in a Class of Non Convex Optimization with Guarantees cs.LG · 2022 · author #3
  24. Joint Location and Cost Planning in Maximum Capture Facility Location under Multiplicative Random Utility Maximization math.OC · 2022 · author #4
  25. Estimation of Recursive Route Choice Models with Incomplete Trip Observations econ.EM · 2022 · author #1
  26. Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach cs.GT · 2022 · author #1
  27. Robust Entropy-regularized Markov Decision Processes cs.LG · 2021 · author #1
  28. Robust Maximum Capture Facility Location under Random Utility Maximization Models math.OC · 2021 · author #3
  29. Submodularity and Local Search Approaches for Maximum Capture Problems under Generalized Extreme Value Models math.OC · 2021 · author #3
  30. A Relation Analysis of Markov Decision Process Frameworks math.OC · 2020 · author #1
  31. Modeling Route Choice with Real-Time Information: Comparing the Recursive and Non-Recursive Models eess.SY · 2020 · author #2
  32. Robust Product-line Pricing under Generalized Extreme Value Models math.OC · 2019 · author #1
  33. Inverse Reinforcement Learning with Missing Data cs.LG · 2019 · author #1
  34. Generalized Maximum Causal Entropy for Inverse Reinforcement Learning cs.LG · 2019 · author #1

Mentions

  • 2509.01595 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2509.01562 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2505.21182 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2505.18595 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2501.18944 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2501.01764 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2412.17021 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2410.08307 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2402.13147 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2410.01954 #3 · arxiv_oai · confidence 0.70 Tien Mai
  • 2312.10385 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2408.02925 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2407.18532 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2403.04264 #4 · arxiv_oai · confidence 0.70 Tien Mai
  • 2301.11592 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2205.07345 #4 · arxiv_oai · confidence 0.70 Tien Mai
  • 2110.08497 #3 · arxiv_oai · confidence 0.70 Tien Mai
  • 2310.06801 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2308.10188 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2306.04606 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2304.08790 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2301.12232 #1 · arxiv_oai · confidence 0.70 Tien Mai
  • 2210.16915 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2208.09611 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 2205.15624 #3 · arxiv_oai · confidence 0.70 Tien Mai
  • 2204.12992 #1 · arxiv_oai · confidence 0.70 Tien Mai
  • 2204.11451 #1 · arxiv_oai · confidence 0.70 Tien Mai
  • 2102.05754 #3 · arxiv_oai · confidence 0.70 Tien Mai
  • 2112.15364 #1 · arxiv_oai · confidence 0.70 Tien Mai
  • 1912.09552 #1 · arxiv_oai · confidence 0.70 Tien Mai
  • 2008.07820 #1 · arxiv_oai · confidence 0.70 Tien Mai
  • 1911.06928 #1 · arxiv_oai · confidence 0.70 Tien Mai
  • 2005.05783 #2 · arxiv_oai · confidence 0.70 Tien Mai
  • 1911.06930 #1 · arxiv_oai · confidence 0.70 Tien Mai

Frequent Coauthors