Product Ranking on Online Platforms

On online platforms, consumers face an abundance of options that are displayed in the form of a position ranking. Only products placed in the first few positions are readily accessible to the consumer, and she needs to exert effort to access more options. For such platforms, we develop a two-stage sequential search model where, in the first stage, the consumer sequentially screens positions to observe the preference weight of the products placed in them and forms a consideration set. In the second stage, she observes the additional idiosyncratic utility that she can derive from each product and chooses the highest-utility product within her consideration set. For this model, we first characterize the optimal sequential search policy of a welfare-maximizing consumer. We then study how platforms with different objectives should rank products. We focus on two objectives: (i) maximizing the platform’s market share and (ii) maximizing the consumer’s welfare. Somewhat surprisingly, we show that ranking products in decreasing order of their preference weights does not necessarily maximize market share or consumer welfare. Such a ranking may shorten the consumer’s consideration set due to the externality effect of high-positioned products on low-positioned ones, leading to insufficient screening. We then show that both problems—maximizing market share and maximizing consumer welfare—are NP-complete. We develop novel near-optimal polynomial-time ranking algorithms for each objective. Further, we show that, even though ranking products in decreasing order of their preference weights is suboptimal, such a ranking enjoys strong performance guarantees for both objectives. We complement our theoretical developments with numerical studies using synthetic data, in which we show (1) that heuristic versions of our algorithms that do not rely on model primitives perform well and (2) that our model can be effectively estimated using a maximum likelihood estimator. This paper was accepted by Gabriel Weintraub, revenue management and market analytics.

The Moment-SOS hierarchy and the Christoffel-Darboux kernel

We consider the global minimization of a polynomial on a compact set B. We show that each step of the Moment-SOS hierarchy has a nice and simple interpretation that complements the usual one. Namely, it computes coefficients of a polynomial in an orthonormal basis of L 2 (B,μ) where μ is an arbitrary reference measure whose support is exactly B. The resulting polynomial is a certain density (with respect to μ) of some signed measure on B. When some relaxation is exact (which generically takes place) the coefficients of the optimal polynomial density are values of orthonormal polynomials at the global minimizer and the optimal (signed) density is simply related to the Christoffel-Darboux (CD) kernel and the Christoffel function associated with μ. In contrast to the hierarchy of upper bounds which computes positive densities, the global optimum can be achieved exactly as integration against a polynomial (signed) density because the CD-kernel is a reproducing kernel, and so can mimic a Dirac measure (as long as finitely many moments are concerned).

Higher order schemes in time for the surface quasi-geostrophic system under location uncertainty

<p>In this work we consider the surface quasi-geostrophic (SQG) system under location uncertainty (LU) and propose a Milstein-type scheme for these equations. The LU framework, first introduced in [1], is based on the decomposition of the Lagrangian velocity into two components: a large-scale smooth component and a small-scale stochastic one. This decomposition leads to a stochastic transport operator, and one can, in turn, derive the stochastic LU version of every classical fluid-dynamics system.<span> </span></p><p>    SQG is a simple 2D oceanic model with one partial differential equation, which models the stochastic transport of the buoyancy, and an operator which relies the velocity and the buoyancy.</p><p><span>    </span>For this kinds of equations, the Euler-Maruyama scheme converges with weak order 1 and strong order 0.5. Our aim is to develop higher order schemes in time: the first step is to consider Milstein scheme, which improves the strong convergence to the order 1. To do this, it is necessary to simulate or estimate the Lévy area [2].</p><p><span>    </span>We show with some numerical results how the Milstein scheme is able to capture some of the smaller structures of the dynamic even at a poor resolution.<span> </span></p><p><strong>References</strong></p><p>[1] E. Mémin. Fluid flow dynamics under location uncertainty. <em>Geophysical & Astrophysical Fluid Dynamics</em>, 108.2 (2014): 119-146.<span> </span></p><p>[2] J. Foster, T. Lyons and H. Oberhauser. An optimal polynomial approximation of Brownian motion. <em>SIAM Journal on Numerical Analysis</em> 58.3 (2020): 1393-1421.</p>

Optimal approximants and orthogonal polynomials in several variables

We discuss the notion of optimal polynomial approximants in multivariable reproducing kernel Hilbert spaces. In particular, we analyze difficulties that arise in the multivariable case which are not present in one variable, for example, a more complicated relationship between optimal approximants and orthogonal polynomials in weighted spaces. Weakly inner functions, whose optimal approximants are all constant, provide extreme cases where nontrivial orthogonal polynomials cannot be recovered from the optimal approximants. Concrete examples are presented to illustrate the general theory and are used to disprove certain natural conjectures regarding zeros of optimal approximants in several variables.

Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems

We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achieves the near optimal O~(dκlog⁡(1/ϵ)) query complexity for a d-sparse matrix, where κ is the condition number, and ϵ is the desired precision. Neither algorithm uses phase estimation or amplitude amplification.