Ozan Candogan

About

Ozan Candogan is the Nicholson Family Professor of Operations Management in the Wallman Society of Fellows at the University of Chicago Booth School of Business. Before joining Chicago Booth, he was an Assistant Professor at the Fuqua School of Business, where he was part of the Decision Sciences area. He earned his Ph.D. and M.S. degrees in Electrical Engineering and Computer Science from the Massachusetts Institute of Technology. Professor Candogan's primary research area is social and economic networks, focusing on two complementary themes. First, he investigates the impact of networks on operational decisions by studying how to leverage network data—such as social networks, mobility networks, and trading networks—to improve operational decisions including pricing, inventory management, information disclosure, and facility location. He also explores the value of such data in various operational settings. Second, he develops novel approaches and tools for analyzing complex social and economic systems, applying these to characterize equilibria and dynamics in games, study equilibria and comparative statics in trading networks, and design information disclosure policies. His research has practical applications in the operations of online social networks, ride-sharing platforms, delivery platforms, two-sided marketplaces, supply chains, and online advertising platforms. His work has been published in leading journals such as Management Science, Operations Research,…

Research topics

• Computer Science
• Computer Security
• Internet privacy
• Mathematics

Selected publications

• Optimal Signaling of Content Accuracy: Engagement vs. Misinformation

  Operations Research · 2020 · 75 citations

  1st authorCorresponding
  DOI

• Optimal disclosure of information to privately informed agents

  Theoretical Economics · 2023-01-01 · 20 citations

  articleOpen access1st authorCorresponding

  We study information design with multiple privately informed agents who interact in a game. Each agent's utility is linear in a real‐valued state. We show that there always exists an optimal mechanism that is laminar partitional and bound its “complexity.” For each type profile, such a mechanism partitions the state space and recommends the same action profile within a partition element. Furthermore, the convex hulls of any two partition elements are such that either one contains the other or th…

  PublisherDOI

• Persuasion in Networks: Public Signals and Cores

  Operations Research · 2022-04-08 · 14 citations

  article1st authorCorresponding

  In many social networks, individuals’ actions depend on the actions of their peers and their information. How can a designer design informative signals to induce a desired outcome in a networked system? Candogan answers this question in a setting where the designer is restricted to using public signaling mechanisms. He provides a convex programming framework for obtaining optimal public signaling mechanisms in networks where agents’ actions exhibit local strategic complementarities and character…

  PublisherDOI

• The Value of Information Design in Supply Chain Management

  Management Science · 2024-11-11 · 8 citations

  article1st authorCorresponding

  This paper studies an information design problem of a retailer in a two-tier supply chain that procures a single type of product from a supplier. The supplier needs to decide on a production quantity by balancing the shortage cost and the excess inventory holding cost with respect to the retailer’s demand. The retailer’s demand is random, but the retailer receives an informative signal about the demand before the supplier sets the production quantity and places orders after learning the demand r…

  PublisherDOI

• Managing Resources for Shared Micromobility: Approximate Optimality in Large-Scale Systems

  Management Science · 2024-10-14 · 7 citations

  article

  We consider the problem of managing resources in shared micromobility systems (bike sharing and scooter sharing). An important task in managing such systems is periodic repositioning/recharging/sourcing of units to avoid stockouts or excess inventory at nodes with unbalanced flows. We consider a discrete-time model; each period begins with an initial inventory at each node in the network, and then, customers (demand) materialize at the nodes. Each customer picks up a unit at the origin node and…

  PublisherDOI

Frequent coauthors

• Asuman Ozdaglar

  20 shared

• Pablo A. Parrilo

  15 shared

• Kostas Bimpikis

  Stanford University

  13 shared

• Yiding Feng

  University of Chicago

  12 shared

• John R. Birge

  University of Chicago

  11 shared

• Daniela Sabán

  Palo Alto University

  11 shared

• Philipp Strack

  Yale University

  10 shared

• Santiago Balseiro

  8 shared

Education

• Ph.D., Electrical Engineering and Computer Science

  Massachusetts Institute of Technology

• M.S., Electrical Engineering and Computer Science

  Massachusetts Institute of Technology

Awards & honors

• MSOM Young Scholar Prize (2023)
• Finalist for the MSOM Best OM Paper in Operations Research A…
• INFORMS Revenue Management and Pricing Section Prize (2022)
• Finalist for the M&SOM Service Management SIG Prize (2021)
• Winner of the LinkedIn Economic Graph Challenge (2015)

Similar researchers at University of Chicago

• Amy Wardh-29
• Rene Caldenteyh-17