Seminars / Conferences

Time and Location: 12:00PM – 1:20PM
Jon M Huntsman Hall (JMHH)
3730 Walnut St.
Philadelphia, PA 19104
Suite 540/541 JMHH (unless otherwise noted)

To schedule a meeting with a speaker, contact: oid.seminar@wharton.upenn.edu

Seminars 2026-2027

Fall 2026

Tuesday, September 22, 2026

Seminar held in JMHH 540

Presenter: Ramandeep Randhawa – USC Marshall School of Business

Title: Service Operations for Justice on Time

Abstract

Justice systems are high-stakes, complex operations that shape societies and lives through the rule of law.  Limited judicial resources can lead to costly delays, stunted economic development, and failure to deliver justice. Using the Supreme Court of India as an exemplar of such resource-constrained settings, we apply ideas from service operations to study judicial delay. Specifically, we model court dynamics as a case-management queue, in which each case may experience multiple service encounters spread across time, all necessarily involving the same server.

We employ data-driven calibrated simulations to study this analytically intractable queue. We identify key sources of inefficiency that drive congestion. We demonstrate how operational interventions can reduce expected delay by as much as 65%.

We will also discuss our ongoing work on MSOM’s Grand Challenge on OM-informed Justice Design, highlighting open problems where the operations management community is well suited to improve access to justice and the timeliness and fairness of the judiciary.

Tuesday, October 6, 2026

Seminar held in JMHH 540

Presenter: Somya Singhvi – USC Marshall School of Business

Title: Improving Productivity in Distributed Supply Chains: Data-Driven Supervision and AI-Enabled Voice Feedback

Abstract

Millions of workers in developing economies produce from dispersed, home-based settings, making it costly for firms to monitor production, communicate timely performance information, and provide support. We study two interventions, implemented with a leading handmade-rug exporter in India, that use data and AI to improve productivity among rural women weavers. First, detailed operational data show that more frequent and consistent supervisor visits substantially raise productivity: an instrumental-variables analysis indicates that reducing the average time between visits by one day increases weaving rates by 8.5%, with larger effects for complex rugs. We translate these insights into an optimization-based scheduling framework. In a 25-week field implementation covering nearly 6,000 visits across 200 looms, treatment looms experience a 16.7% increase in weaving rates. Second, we examine whether low-cost digital communication can extend the reach of scarce human supervision. In a randomized controlled trial with more than 500 weavers, weekly AI-generated WhatsApp voice messages based on each worker’s recent production records increase weaving progress by 10.5%. Both pay- and progress-oriented messages improve productivity, with somewhat larger effects for progress feedback, while the identity of the speaker—the firm’s CEO versus the weaver’s branch manager—has similar average effect. Gains are concentrated among weavers with less frequent prior supervision, no formal education, and more complex tasks. Together, the studies show how organizations can combine better deployment of scarce managerial attention with scalable AI-enabled feedback to reduce informational and self-regulatory frictions in distributed, low-literacy work environments.
Related papers:

Tuesday, October 13, 2026

Seminar held in JMHH 540

Presenter: Ilan Lobel – NYU Stern School of Business

Title: Pricing AI as a Service

Abstract

Ilan Lobel is the Fauvelais Family Professor of Data-Driven Operations at New York University’s Stern School of Business. His work sits at the intersection of artificial intelligence, data science, economics, and operations, with a particular focus on how data, algorithms, and AI shape digital marketplaces. Professor Lobel serves as the director of the Andre Koo Technology and Entrepreneurship MBA Program and as the coordinator of the Stern’s MBA AI specialization. His research has received the 2018 MSOM Young Scholar Prize, the 2021 INFORMS TIMES Award, and the INFORMS Revenue Management and Pricing Section Prize in both 2014 and 2024. He currently serves as area editor of Operations Research. His teaching has been recognized by the 2017 Poets & Quants Top 40 MBA Professors Under 40 list and the 2018 Stern Distinguished Teaching Award.

Ilan’s take will present his paper, Pricing AI as a Service.

Tuesday, October 20, 2026

Seminar held in JMHH 540

Presenter: Andrei Hagiu – Boston University Questrom School of Business

Title: Personalization, Data Portability, and Competitive Dynamics

Abstract

We study data portability in a model of dynamic price competition where product quality improves for each customer as personal data accumulates with usage. This can reflect AI-driven personalization based on customer data or customers embedding their own data into the firm’s product through usage. We show that when consumers are forward looking, a firm strictly benefits from offering portability if and only if doing so increases total future surplus per initial customer. We identify conditions ensuring that at least one firm strictly prefers to offer portability, with both firms preferring to do so when product differentiation is sufficiently strong relative to differences in net value. By contrast, when consumers are myopic, there are equilibria in which neither firm offers portability. We identify conditions under which a portability mandate harms or benefits consumers. We extend these results to settings with personalized prices and with imperfect data portability.

Tuesday, October 27, 2026

Seminar in JMHH 540

Presenter: Dokyun Lee – Boston University Questrom School of Business

Title: Scylla Ex Machina: The Illusion and Epistemic Risks of LLMs-as-Human-Surrogates

Abstract

LLM-based digital twins are increasingly proposed as substitutes for human participants across social science, market research, and policy analysis. I identify fundamental epistemic and structural challenges to using them as replacements for human evidence, and even to the weaker claim that they can help explore human behavior in data-thin regions involving new people or tasks. After a brief tour of the LLM research frontier and its peculiarities, I connect these developments to longstanding arguments in the philosophy of AI: LLMs learn from vast, noisy, and epistemically contaminated data and lack the embodied experience and survival-driven objectives that shape human cognition and behavior. Human behavior itself is heterogeneous, non-objective, changing, and often unstable—quite different from the systems traditional digital twins are designed to model. I organize these issues into a framework for understanding the resulting failure modes, theoretical limits, and empirical dilemmas of LLMs-as-human-surrogates, with particular attention to the validation problem and the conditions and limits of transportability across populations, tasks, and contexts. I conclude with two new empirical studies that add to the critical examination of LLMs-as-human-surrogates.

Spring 2026

Tuesday, February 3, 2026

Seminar held in JMHH 540

Presenter: Nicole Immorlica – Yale University

Title: Agentic Markets — Equilibrium Effects of Improving Search

Abstract

Motivated by advances in AI agents, we study the impact of improved search technology on learning and welfare in agentic markets. Consumers engage in costly search to acquire signals of product fit prior to purchase. The market aggregates observations — indications of fit for searched products and indications of quality for chosen products — thereby guiding future searches. We characterize the long-run steady-state of the resulting dynamics and study the impact of improving search technology.  We find cheaper search improves learning and consumer surplus, whereas more informativeness can degrade both {\em unless} the market learns as much as consumers about the products, e.g., by “reading the transcript” of agentic conversations.  Finally, we consider the impact of search on how businesses set prices.  In symmetric markets, market efficiency improves when search is cheaper and/or more informative. However, more informative search may decrease consumer surplus as it weakens competition.

Tuesday, February 17, 2026

Seminar held in JMHH 540

Presenter: Azarakhsh Malekian – University of Toronto

Title: Rethinking Informational Assumptions in Mechanism Design

Abstract

In classical mechanism design, buyers are assumed to know their private valuations, while the seller, who does not observe these valuations, designs allocations and payments to maximize revenue. In many modern online platform environments, however, these informational assumptions no longer hold. Buyers may have only partial information about their own valuations, or the seller may be able to acquire information about buyers’ valuations. In this talk, I present a few papers that incorporate these alternative informational structures and characterize the optimal selling mechanisms under each. 

First, I study a setting in which buyers do not know their valuations and must incur an inspection cost to learn them. I characterize the optimal selling mechanisms under both observable and unobservable inspection and show how the Magician’s Problem can be used to obtain a 1 – 1/\sqrt{k+3}-approximation when selling k items to multiple buyers.

Next, I turn to inspection on the seller’s side. I show how a seller’s ability to condition payments on partial information about buyers’ valuations can fundamentally alter not only the structure of the optimal mechanism but also the analytical tools required to derive it. In particular, I demonstrate how methods from the calculus of variations, combined with convex analysis, can be used to characterize the optimal selling mechanism.

Tuesday, February 24, 2026

Seminar held in JMHH 540

Presenter: Nikhil Garg – Cornell ORIE

Title: Recommendations in the NYC High School Match (and other high-stakes settings)

Abstract

Recommendation and search systems are now used in high-stakes settings, including to help find jobs, schools, and partners. Building public interest recommender systems in such settings bring both individual-level (enabling exploration, diversity, data quality) and societal (fairness, capacity constraints, monoculture) challenges. I will talk about an ongoing collaboration with the NYC Public Schools, in which we designed and deployed an informational intervention to help students from underserved middle schools discover high-performing, nearby high schools where they have a strong individual admissions likelihood. However, recommending specific programs brings a methodological challenge: if many applicants are recommended the same program, affecting admissions likelihoods, then the recommendations may be self-defeating. Time permitting, I’ll also overview other directions in tackling such challenges, including on (a) algorithmic monoculture and LLM homogeneity, (b) a platform to help discharge patients to long-term care facilities, (c) feed ranking algorithms on Bluesky for research paper recommendations.

Tuesday, March 3, 2026

Seminar held in JMHH 540

Presenter: Sebastien Martin – Northwestern University: Kellogg School of Management

Title: Talk 1: Teaching with AI Talk 2: Relative Monte Carlo for Reinforcement Learning

Abstract

Talk 1:

Three years ago, AI started disrupting education in ways that felt mostly threatening. Since then, I’ve been iterating on how to harness it in my Operations Management and AI Foundations for Managers courses at Kellogg, and the result has been deeply empowering.

In this talk, I’ll show you what teaching with AI actually looks like today, from both the instructor’s and the student’s perspective. Through live demos, you’ll experience an AI teaching assistant now used across many Kellogg courses and generating hundreds of thousands of student interactions, AI-powered case studies where students interview simulated characters instead of reading a static document, and AI-assisted grading that closes the feedback loop at scale. I’ll also briefly touch on the research side of this work, including a large-scale randomized controlled trial on AI in higher education.

My goal is simple: to share concrete reasons to be very optimistic about the future of AI in education.

Talk 2:

We propose and analyze a new policy gradient algorithm for reinforcement learning (RL), relative Monte Carlo (rMC). The method estimates policy gradients using relative returns between a root sample path and counterfactual simulated paths, instantiated by taking a different action from the root. The resulting gradient estimate is both unbiased and has low variance. rMC is compatible with any differentiable policy, including neural networks, and is guaranteed to converge even for infinite horizon tasks. The method utilizes common random number coupling of the simulated paths to reduce variance and increase the likelihood that paths merge, thereby reducing simulation complexity. It is particularly well suited to discrete event control problems where actions have a “local” effect, such as queueing, supply chain, or ride-hailing problems. Indeed, we show that it has provably low complexity for a family of inventory control problems. Numerical tests on a challenging inventory and fulfillment problem show that compared to traditional RL approaches, rMC converges in far fewer iterations (lower variance), has better policy performance (unbiased), and requires minimal hyperparameter tuning.

Tuesday, March 24, 2026

Seminar in JMHH 540

Presenter: Karim Lakhani – Harvard Business School

Title: The Cybernetic Teammate: A Field Experiment on Generative AI and Teamwork

Abstract

We examine how artificial intelligence impacts three core pillars of collaboration—performance enhancement, expertise integration, and social engagement—through a pre-registered field experiment with 791 professionals at Procter & Gamble, a global consumer packaged goods company. Working on real product innovation challenges, professionals were randomly assigned to work either with or without AI, and either individually or with another professional in new product development teams. Our findings reveal that (1) AI significantly enhances performance: individuals with AI matched the performance of teams without AI, demonstrating that AI can effectively replicate certain benefits of human collaboration; (2) AI helps bridge functional silos: without AI, R&D professionals tended to suggest more technical solutions, while Commercial professionals leaned toward commercially oriented proposals, whereas professionals using AI produced more balanced solutions regardless of background; and (3) AI’s language-based interface prompted more positive self-reported emotional responses, suggesting it can fulfill part of the social and motivational role traditionally offered by human teammates. Finally, decomposing the innovation process reveals that AI primarily enhances the quality of generated ideas—elevating the entire distribution of creative output—while human judgment retains value in evaluative selection. This finding highlights the multiple and complementary roles that human and AI partners can play in new product development and creative problem-solving tasks. More generally, our results suggest that AI adoption in knowledge work affects not only performance but also how expertise and sociality manifest within teams, compelling organizations to rethink the structure of collaborative work.

Tuesday, March 31, 2026

Seminar in JMHH 540

Presenter: Ryan Buell – Harvard Business School

Title: The Everyday Tradeoffs of Working Multiple Jobs

Abstract

As operations increasingly rely upon flexible labor models – such as gig, part-time, and remote work – it has become commonplace for individuals to work multiple jobs. Across two descriptive studies, relying on a combination of transaction-level data from 90,232 customers of a nationwide retail bank and primary survey data, we study whether people with multiple jobs live their off-the-clock lives materially differently from equivalently compensated people who rely on a single job. We find that people who rely on multiple jobs spend 18.1 percentage points (p.p.) less of their labor income overall, which is driven by a 16.5 p.p. decrease in the share of income spent on necessities and a 2.0 p.p. decrease in the share of income spent on indulgences. They spend meaningfully more on education and transportation, but notably less in all other key spending areas, including categories traditionally associated with enhanced physical wellbeing, such as healthcare and food, and experiential categories often associated with mental wellbeing, such as travel and entertainment. These patterns converge with responses from the General Social Survey, in which equivalently-compensated individuals who rely on multiple jobs report lower financial satisfaction and lower family satisfaction than their single-income counterparts. Together, the findings describe systematic variation in off-the-clock outcomes across different working structures and surface considerations for job design that may promote greater sustainability for employees.

Tuesday, April 7, 2026

Seminar in JMHH 540

Presenter: Yong Tan – University of Washington: Foster School of Business

Title: Algorithmic Collusion or Competition: The Role of Platforms’ Recommender Systems

Abstract

Recent scholarly work has extensively examined the phenomenon of algorithmic collusion driven by AI-enabled pricing algorithms. However, online platforms commonly deploy recommender systems that influence how consumers discover and purchase products, thereby shaping the reward structures faced by pricing algorithms and ultimately affecting competition dynamics and equilibrium outcomes. To address this gap in the literature and elucidate the role of recommender systems, we propose a novel repeated game framework that integrates several key components. We first develop a structural search model to characterize consumers’ decision-making processes in response to varying recommendation sets. This model incorporates both observable and unobservable heterogeneity in utility and search cost functions, and is estimated using real-world data. Building on the resulting consumer model, we formulate personalized recommendation algorithms designed to maximize either platform revenue or consumer utility. We further introduce pricing algorithms for sellers and integrate all these elements to facilitate comprehensive numerical experiments. Our experimental findings reveal that a revenue-maximizing recommender system intensifies algorithmic collusion, whereas a utility-maximizing recommender system encourages more competitive pricing behavior among sellers. Intriguingly, and contrary to conventional insights from the industrial organization and choice modeling literature, increasing the size of recommendation sets under a utility-maximizing regime does not consistently enhance consumer utility. This counterintuitive “more is less” effect arises because expanding the recommendation set reduces the recommender system’s ability to effectively influence the pricing strategies of AI-driven algorithms through dynamic rewards. Moreover, the degree of horizontal differentiation moderates this phenomenon in unexpected ways. The “more is less” effect does not arise at low levels of differentiation, but becomes increasingly pronounced as horizontal differentiation increases. This is because, in such contexts, consumers’ decisions are driven more by their inherent preferences than by price considerations. As a result, when the recommendation set is large, higher-priced products experience relatively smaller declines in their rewards and can sustain elevated prices, supported by the persistent demand engendered by horizontal preferences. These findings provide valuable insights for regulators, platform designers, and market participants, and they open up a range of promising avenues for future research.

Fall 2026

Tuesday, September 9, 2025

Seminar held in JMHH 540

Presenter: Ran Shorrer – The Pennsylvania State University

Title: Algorithmic Collusion by Large Language Models

Abstract

The rise of algorithmic pricing raises concerns of algorithmic collusion. We conduct experiments with algorithmic pricing agents based on Large Language Models (LLMs). We find that (1) LLM- based agents are adept at pricing tasks, (2) LLM-based pricing agents quickly and autonomously reach supracompetitive prices and profits in oligopoly settings, and (3) variation in seemingly innocuous phrases in LLM instructions (“prompts”) may substantially influence the degree of supracompetitive pricing. Off-path analysis using novel techniques uncovers price-war concerns as contributing to these phenomena. Our results extend to auction settings. Our findings uncover unique challenges to any future regulation of LLM-based pricing agents, and generative Al pricing agents more broadly.

Tuesday, September 30, 2025

Seminar held in JMHH 540

Presenter: Ming Hu – University of Toronto: Rotman School of Management

Title: (De)Pooling, Staffing, and Routing for Spatial Match

Abstract

Spatial mismatch, i.e., location misalignment between where supply and demand arise, is a common source of inefficiency in matching applications such as ride-hailing. In ride-hailing, this misalignment often leads drivers to travel long distances to pick up riders. First, we showcase how spatial mismatch can be mitigated through the commonly used operations concept of pooling (i.e., aggregating demand spatially or temporally) and, perhaps surprisingly, depooling (i.e., restricting matches to be more local, such as zoning and localization). Second, with temporal/spatial pooling, we study the optimal staffing problem for an on-demand vehicle-sharing firm operating over a d-dimensional service region. The firm makes a one-time capacity decision of how many vehicles to deploy and dynamically controls vehicle-customer matching and vehicle routing over time. The objective is to minimize the long-run average cost, which includes vehicle operations costs and customer waiting costs. We show that, jointly with optimal matching and routing, the optimal staffing level consists of a nominal load (i.e., the absolute minimum number of vehicles to ensure system stability) plus a safety buffer. This safety level depends on key system parameters, including the dimensionality d, the distributions of customer origins and destinations, and the customer-pooling capacity q (i.e., the maximum number of customers per vehicle). Specifically, (i) when q=1, the safety level scales with the customer arrival rate raised to the power of d/(d+1), a result that mirrors earlier findings under stylized spatial models. (ii) When q>1, the scaling becomes 2d/(2d+1), which, to our knowledge, was not discovered in the past.

Tuesday, October 7, 2025

Seminar in JMHH 540

Presenter: Hamsa Bastani – The Wharton School

Title: AI in Education: from Overreliance to Critical Engagement

Abstract

The rapid integration of AI into educational contexts presents opportunities and risks. This talk reports findings from two field studies examining how students interact with AI and the subsequent impacts on learning. In the first study, we implemented a 12-week chess training program to investigate repeated exposure to AI-assisted learning. While student autonomy is often assumed to support agency, we find that giving learners full control over when to request AI assistance diminished engagement and halved performance gains. The immediate convenience of help displaced the productive struggle required for skill development, though these negative effects were fully mitigated among highly motivated students but not among highly skilled ones.

The second study, conducted with 800 first-year computer science students, tested a targeted intervention: training with “adversarial examples”—problems designed to elicit incorrect responses from ChatGPT. Students who received this training developed stronger skills in identifying and correcting AI errors, enabling more effective human–AI collaboration. Taken together, these studies suggest that simply providing students with unrestricted access to AI tools can be harmful. However, structured interventions that teach students to critically evaluate AI outputs hold promise. [Based on joint work with Stefanos Poulidis, Angel Chung, and Osbert Bastani.]

Tuesday, October 21, 2025

Seminar in JMHH 540

Presenter: Christian Terwiesch – The Wharton School

Title: Using LLMs to Generate and Evaluate Business Opportunities

Abstract

This research investigates the ability of large language models (LLMs) to generate and evaluate
new product ideas. Across a series of studies, we highlight both the strengths and limitations of LLMs in product innovation. In our first study, we show that LLM-generated ideas achieve higher average quality than human ideas (measured by purchase intent) and are seven times more likely to rank in the top 10%. A second study demonstrates that this creativity advantage is not simply due to the LLM’s superior persuasive skills. Our third and fourth studies reveal a key weakness: AI-supported brainstorming produces ideas that are less novel at the individual level and less diverse at the set level. Finally, in our fifth and sixth studies, we shift focus from idea generation to evaluation, exploring how LLMs can be used to forecast the success of new
opportunities.

Tuesday, November 4, 2025

Seminar in JMHH 540

Presenter: Borja Apaolaza Emparanza – The Wharton School

Title: Rented Today, Bought Tomorrow: Buyout Pricing in the Circular Economy

Abstract

Online rental platforms that allow customers to purchase rented goods present a complex pricing
challenge: setting buyout prices that balance immediate sales revenue with future rental income, while accounting for item-specific factors such as condition, popularity, and customer preferences. In this
paper, we develop, estimate, and validate a data-driven framework to inform buyout prices in this setting. Leveraging a Markov Decision Process (MDP), our framework assesses individual item value
based on rental demand, product attrition, and customer purchase likelihood. We use real-world data
from a leading fashion rental company to demonstrate that our methodology significantly improves profitability compared to existing practices and alternative benchmarks. We estimate that the proposed
pricing policy increases earnings by 3.1% over the company’s current practice. Our analysis also shows
that operating a rental-only business model leaves revenue opportunities untapped, underscoring the
strategic value of buyout options in managing inventory and generating additional income.

Friday, December 2, 2025

Seminar in JMHH 540

Presenter: Jing Dong – Columbia University

Title: Data-Driven Stochastic Modeling via Autoregressive Sequence Models

Abstract

Queueing networks are foundational for analyzing service systems, but their construction has traditionally required substantial domain expertise and manual specification of arrivals, service rules, and routing logic. This talk presents a data-driven framework that leverages autoregressive sequence models to automate the development of queueing network simulators directly from event-stream data. Our approach learns the conditional distributions of event types and times, reframing the modeling task as one of sequence distribution learning. We demonstrate that Transformer-style architectures can effectively parameterize these distributions, enabling automated construction of high-fidelity simulators. As a proof of concept, we validate our framework on event tables generated from diverse queueing networks, highlighting its utility for simulation, uncertainty quantification, and counterfactual evaluation. By harnessing advances in machine learning, our framework lowers the barrier to applying queueing models and paves the way for scalable, data-driven decision support across a wide range of service operations.

Tuesday, December 9, 2025

Seminar in JMHH 540

Presenter: Kostas Bimpikis – Stanford University

Title: Market Fragmentation and Inefficiencies in Maritime Shipping

Abstract

Maritime transportation accounts for 90% of global trade, but ballasting—vessels traveling without cargo—imposes substantial economic and environmental costs. This paper examines the oil transportation industry, where approximately half of all miles traveled are sailed empty. While some ballasting is necessary due to inherent supply-demand imbalances in oil markets, our analysis demonstrates that market structure, specifically the fragmentation of vessel ownership, is also a primary driver, accounting for 10-20% of the total empty miles traveled depending on the market segment. In addition, we show that consolidating vessels into small shipping pools—sets of vessels operated under unified management—can reduce ballasting-related carbon emissions by up to 15%. This market-driven approach, which is gaining industry adoption, maintains competitive dynamics, given the limited scale of consolidation, while significantly improving efficiency. The gains arise from enhanced coordination within larger pools and expanded port coverage, reducing unnecessary vessel repositioning. More broadly, our findings quantitatively demonstrate that organizational changes alone—specifically, the consolidation of vessel operations—can generate significant environmental improvements by reducing empty miles. This provides a practical path toward sustainability that can complement and amplify the benefits of technological innovation.

Conferences

October 17-18, 2024

Information

Since 2006, the Workshop for Empirical Research in Operations Management brings together a community of scholars with a passion for empirical research in Operations. The purpose of the Workshop is to exchange research ideas, share experiences in the publication process, discuss methodological issues, and grow together as a group of colleagues with a common research interest.