Kenny Wongchamcharoen

Kenny Wongchamcharoen

Operations Research + Data Science + Math @ Berkeley

Research

Conference Proceedings

Do Large Language Models (LLMs) Understand Chronology?

Wongchamcharoen, P. K., & Glasserman, P.

[View Abstract] Large language models have shown great potential as forecasting tools in finance and economics, but backtesting performance is subject to look-ahead bias if the period overlaps with an LLM’s training window. Prompt-based attempts to avoid look-ahead bias require that LLMs understand chronology. We test LLMs’ ability to understand and enforce chronological order in three types of tasks: sorting randomly shuffled historical events; conditional sorting of events defined by some conditions; and anachronism detection based on intersections of multiple timelines. Our experiments use events that we first confirm are known to the LLM; this ensures that we test chronological understanding on an LLM’s pretrained internal knowledge. Across three LLM families— GPT-4.1 (standard), GPT-5 (hybrid-reasoning), and Claude 3.7 Sonnet (large-reasoning, with and without Extended Thinking), we find that performance degrades rapidly with problem complexity but improves greatly for reasoning models with test-time extended reasoning. These patterns are important for the real-time application of LLMs in finance.

Working Paper & Preprints

CentaurBench: Benchmarking LLM Capabilities on Augmenting vs. Automating Real-World Work Tasks

Wongchamcharoen, P. K., Gulati, K., Fong, M. M., & Nagaraj, A.

[View Abstract] Most LLM benchmarks rank models on their ability to automate work tasks. In practice, however, models are often used to assist other (human or LLM) agents. The question that drives model selection is therefore not only which model produces the best output, but which model most improves the work of another (weaker) agent. We introduce a unified framework that evaluates the capability of models to automate and augment another agent's performance. Across seven economically grounded real-world tasks, an assistant model writes assistance text for a standardized lower-capacity worker model, which produces the deliverable. In automation mode, the assistant produces the output directly. Outputs are scored through blind pairwise comparisons by an LLM judge panel with task-specific rubrics, replicated across ten runs. Rankings across the two regimes are only modestly correlated, and the automation winner loses augmentation on five of seven tasks. Assistance is not reliably positive. The unaided worker outranks every assisted condition on three tasks, and only one model's guidance beats no guidance on average. These results suggest that automation ability is an incomplete proxy for assistance quality, motivating benchmarks that evaluate models according to the roles they play in human-AI and multi-agent systems.
  • Accepted at the 2026 Wharton Generative AI & Business Conference. [arXiv]

Contributions as an RA

Calyber: A Ridesharing Game.

Shen, Y., Yan, C. and Yan, J.

INFORMS Transactions on Education.

[View Abstract] This case introduces Calyber, a simulation-based game designed to provide a hands-on and engaging experience in developing real-time pricing and matching decisions for shared ride services, where multiple riders are pooled into a single vehicle. Students design and implement dynamic pricing and matching policies using a rich historical ridesharing data set, competing for top performance on a holdout test set. Through this case, students gain practical insight into stochastic dynamic decision making within a modern, relevant, and data-driven context. Results from previous class implementations provide strong evidence of enhanced learning and engagement.
  • 🏆 Runner-up, 2025 INFORMS Case Competition [case]

On-Off Systems with Strategic Customers

Sun, Y., Liu, Z., Yan, C.

[View Abstract] Motivated by applications such as urban traffic control and make-to-order systems, we study a fluid model of a single-server, on-off system that can accommodate multiple queues. The server visits each queue in order: when a queue is served, it is "on", and when the server is serving another queue or transitioning between queues, it is "off". Customers arrive over time, observe the state of the system, and decide whether to join. We consider two regimes for the formation of the on and off durations. In the exogenous setting, each queue's on and off durations are predetermined. We explicitly characterize the equilibrium outcome in closed form and give a compact linear program to compute the optimal on-off durations that maximizes total reward collected from serving customers. In the endogenous setting, the durations depend on customers' joining decisions under an exhaustive service policy where the server never leaves a non-empty queue. We show that an optimal policy in this case extends service beyond the first clearance for at most one queue. Using this property, we introduce a closed-form procedure that computes an optimal policy in no more than 2n steps for a system with n queues.
  • Under revision.

Other Research & Awards

Data-Driven Evaluation of Board of Directors Effectiveness: Unsupervised Learning and Predictive Modeling of “Skills Matrices”

Wongchamcharoen, P. K., Stringer, C., Hwang B., Liu, I., & Li, K. [poster]

  • 🏆 Best Data Visualization Award at the 2025 Berkeley CDSS Data Discovery Symposium

Mixed-Integer Linear Program for Options Pricing and Portfolio Optimization

Bin Abdulla, Q. M., Wongchamcharoen, P. K., Jamari, A., Lee J. [code], [poster]

  • 🏆 1st Runner-Up at the 2025 Wells Fargo & Berkeley IEOR Bay Area Decision Sciences Summit
  • Also presented at the 2025 Berkeley IEOR Community Celebration & Alumni Achievement Ceremony

Works in Progress

Flex or Fast? Incentive-Compatible Demand Allocation in Destination-Mode Ride-Hailing Networks

Please refer to my CV for more detailed and complete research assistantships & publications.

Professional Experience

Please refer to my resume for more recent industry experiences.