arXiv subjects

Yu-Wei Hsieh

Publications and source records attributed to Yu-Wei Hsieh.

5 recordsLinked to original sources

arXiv2026

Aggregate Stable Matching with Money Burning

We propose an aggregate notion of non-transferable utility (NTU) stability for decentralized matching markets with fixed prices, where market clearing is achieved through one-sided money burning, which can be interpreted as waiting. Agents are grouped into observable types and are indifferent among individuals within type; equilibrium is defined at the type level and delivers equal indirect utility within each type. We introduce money burning into two types of NTU models: In a deterministic model, we relate our notion to classical Gale--Shapley stability and show how money burning decentralizes stable outcomes under aggregation. We then introduce separable random utility, obtaining an NTU counterpart to Choo and Siow (2006). We prove the existence and uniqueness of equilibrium and provide a stationary queueing interpretation. Finally, we develop a generalized deferred acceptance algorithm based on alternating constrained discrete-choice problems and prove its convergence to the unique equilibrium.

econ.TH↗

arXiv2026

Robust valley-polarized excitonic Mott states and doublons enabled by stacking-controlled moiré geometry

Atomically-thin moiré superlattices offer an optically accessible platform for interacting bosons, where strong onsite repulsion $U_{xx}$ suppresses double occupancy and supports excitonic Mott states at unit filling. However, moiré confinement also enhances phonon- and disorder-assisted relaxation, challenging the robustness of these correlated states under dissipation. Here we show that strengthening the intersite exciton repulsion $V_{xx}$ between neighboring moiré cells offers a distinct route to stabilizing unit-filling excitonic Mott states. In H-stacked WSe2/WS2, moiré confinement endows interlayer excitons with an out-of-plane dipole and a pronounced in-plane quadrupolar charge distribution. Helicity-resolved transient photoluminescence, supported by first-principles-informed modelling, reveals that this quadrupolar geometry increases $V_{xx}$ at unit filling by at least a factor of two relative to the dipolar R-stacked excitons. Despite a slight reduction in $U_{xx}$, the enhanced $V_{xx}$ yields a long-lived, valley-polarized excitonic Mott state at unit filling that persists for ~12 ns - more than twice as long as in R-stacks - and remains robust up to ~50 K. Beyond unit filling, the same geometry supports valley-polarized doublons with fourfold longer lifetimes than in R-stacks. These results establish moiré-geometric control of intersite interactions as a route to stabilizing excitonic Mott states and doublons against dissipation in solids.

cond-mat.mes-hall↗

arXiv2024

Monotone comparative statics for submodular functions, with an application to aggregated deferred acceptance

We propose monotone comparative statics results for maximizers of submodular functions, as opposed to maximizers of supermodular functions as in the classical theory put forth by Veinott, Topkis, Milgrom, and Shannon among others. We introduce matrons, a natural structure that is dual to sublattices that generalizes existing structures such as matroids and polymatroids in combinatorial optimization and M-sets in discrete convex analysis. Our monotone comparative statics result is based on a natural order on matrons, which is dual in some sense to Veinott's strong set order on sublattices. As an application, we propose a deferred acceptance algorithm that operates in the case of divisible goods, and we study its convergence properties.

econ.TH↗

arXiv2021

Yogurts Choose Consumers? Estimation of Random-Utility Models via Two-Sided Matching

The problem of demand inversion - a crucial step in the estimation of random utility discrete-choice models - is equivalent to the determination of stable outcomes in two-sided matching models. This equivalence applies to random utility models that are not necessarily additive, smooth, nor even invertible. Based on this equivalence, algorithms for the determination of stable matchings provide effective computational methods for estimating these models. For non-invertible models, the identified set of utility vectors is a lattice, and the matching algorithms recover sharp upper and lower bounds on the utilities. Our matching approach facilitates estimation of models that were previously difficult to estimate, such as the pure characteristics model. An empirical application to voting data from the 1999 European Parliament elections illustrates the good performance of our matching-based demand inversion algorithms in practice.

econ.EM↗

arXiv2017

Inference on Estimators defined by Mathematical Programming

We propose an inference procedure for estimators defined by mathematical programming problems, focusing on the important special cases of linear programming (LP) and quadratic programming (QP). In these settings, the coefficients in both the objective function and the constraints of the mathematical programming problem may be estimated from data and hence involve sampling error. Our inference approach exploits the characterization of the solutions to these programming problems by complementarity conditions; by doing so, we can transform the problem of doing inference on the solution of a constrained optimization problem (a non-standard inference problem) into one involving inference based on a set of inequalities with pre-estimated coefficients, which is much better understood. We evaluate the performance of our procedure in several Monte Carlo simulations and an empirical application to the classic portfolio selection problem in finance.

econ.EM↗