A Simulation-Based Heuristic to Find Approximate Equilibria with Disaggregate Demand Models

Oligopolistic competition occurs in various transportation markets. In this paper, we introduce a framework to find approximate equilibrium solutions of oligopolistic markets in which demand is modeled at the disaggregate level using discrete choice models, according to random utility theory. Compared with aggregate demand models, the added value of discrete choice models is the possibility to account for more complex and precise representations of individual behaviors. Because of the form of the resulting demand functions, there is no guarantee that an equilibrium solution for the given market exists, nor is it possible to rely on derivative-based methods to find one. Therefore, we propose a model-based algorithmic approach to find approximate equilibria, which is structured as follows. A heuristic reduction of the search space is initially performed. Then, a subgame equilibrium problem is solved using a mixed integer optimization model inspired by the fixed-point iteration algorithm. The optimal solution of the subgame is compared against the best responses of all suppliers over the strategy sets of the original game. Best response strategies are added to the restricted problem until all ε-equilibrium conditions are satisfied simultaneously. Numerical experiments show that our methodology can approximate the results of an exact method that finds a pure equilibrium in the case of a multinomial logit model of demand with a single-product offer and homogeneous demand. Furthermore, it succeeds at finding approximate equilibria for two transportation case studies featuring more complex discrete choice models, heterogeneous demand, a multiproduct offer by suppliers, and price differentiation for which no analytical approach exists.