arXiv subjects

Stephen Morris

Publications and source records attributed to Stephen Morris.

16 recordsLinked to original sources

arXiv2026

Mechanism Design for Alignment and Control

We develop a framework for mechanism design with AI agents whose alignment (preferences) and capabilities (feasible actions and information) are unknown. We want such agents to act on our behalf so mechanisms must incentivize both honesty and obedience. A one-sided imitation structure---capabilities can be concealed but not counterfeited---yields a revelation principle, a characterization of implementable policies via nested cyclical monotonicity, and conditions under which eliciting higher-order beliefs can discipline multiple agents. We apply our framework to stylized examples of (i) sandbagging in which a more capable agent pretends to be less capable; (ii) an alignment--interpretability trade-off, where the two are substitutes in the instrument but complements in value; (iii) discipline via peer scoring; (iv) coupling rewards to induce competition among multiple agents; and (v) scalable oversight and reward shaping.

econ.TH↗

arXiv2026

Integrated photonic computing: towards high-dimensional information processing

The rapid growth of artificial intelligence, coupled with the slowing of Moore's law, is straining computing infrastructure, as CMOS electronics face inherent limits in bandwidth, energy efficiency, and parallelism. Integrated photonic computing encodes and processes information using the phase, amplitude, spatial modes, wavelength channels, and polarisation of guided optical fields, offering a scalable and energy-efficient route beyond charge-based signalling. Here, we review on-chip photonic computing, emphasising the progression from low-dimensional to high-dimensional architectures. At the foundational level, low-dimensional approaches manipulate the phase and amplitude of guided light through Mach-Zehnder interferometers, diffractive structures, microring resonators, and absorptive elements, forming a programmable basis for optical matrix-vector multiplication. Crucially, high-dimensional architectures exploit spatial modes and wavelength channels to carry multiple independent data streams through a single waveguide, achieving higher throughput with moderate hardware overhead. Practical deployment, however, demands more than device innovation. We examine how system-level techniques, from time-wavelength interleaving to hardware-aware training, address energy efficiency, precision, and algorithm-hardware co-design. Five challenges nevertheless remain: electro-optic conversion efficiency, computing parallelism, spatial integration, reconfigurability, and robustness. We highlight emerging topological structures, such as optical skyrmions, as a promising route to fault-tolerant, topologically protected encoding that exploits the largely untapped polarisation degree of freedom. We argue that, by embracing the higher dimensionality of light, photonic computing can offer not merely an incremental improvement but a new paradigm for high-performance, energy-efficient information processing.

physics.optics↗

arXiv2026

Information Design and Mechanism Design: An Integrated Framework

We develop an integrated framework for information design and mechanism design in screening environments with quasilinear utility. Using the tools of majorization theory and quantile functions, we show that both information design and mechanism design problems reduce to maximizing linear functionals subject to majorization constraints. For mechanism design, the designer chooses allocations weakly majorized by the exogenous inventory. For information design, the designer chooses information structures that are majorized by the prior distribution. When the designer can choose both the mechanism and the information structure simultaneously, then the joint optimization problem becomes bilinear with two majorization constraints. We show that pooling of values and associated allocations is always optimal in this case. Our approach unifies classic results in auction theory and screening, extends them to information design settings, and provides new insights into the welfare effects of jointly optimizing allocation and information.

econ.TH↗

arXiv2025

Procurement without Priors: A Simple Mechanism and its Notable Performance

How should a buyer design procurement mechanisms when suppliers' costs are unknown, and the buyer does not have a prior belief? We demonstrate that simple mechanisms - that share a constant fraction of the buyer utility with the seller - allow the buyer to realize a guaranteed positive fraction of the efficient social surplus across all possible costs. Moreover, a judicious choice of the share based on the known demand maximizes the surplus ratio guarantee that can be attained across all possible (arbitrarily complex and nonlinear) mechanisms and cost functions. Similar results hold in related nonlinear pricing and optimal regulation problems.

econ.TH↗

arXiv2025

Incomplete Information Robustness

Consider an analyst who models a strategic situation using an incomplete information game. The true game may involve correlated, duplicated belief hierarchies, but the analyst lacks knowledge of the correlation structure and can only approximate each belief hierarchy. To make predictions in this setting, the analyst uses belief-invariant Bayes correlated equilibria (BIBCE) and seeks to determine which one is justifiable. We address this question by introducing the notion of robustness: a BIBCE is robust if, for every nearby incomplete information game, there exists a BIBCE close to it. Our main result provides a sufficient condition for robustness using a generalized potential function. In a supermodular potential game, a robust BIBCE is a Bayes Nash equilibrium, whereas this need not hold in other classes of games.

econ.TH↗

arXiv2024

A Strategic Topology on Information Structures

Two information structures are said to be close if, with high probability, there is approximate common knowledge that interim beliefs are close under the two information structures. We define an "almost common knowledge topology" reflecting this notion of closeness. We show that it is the coarsest topology generating continuity of equilibrium outcomes. An information structure is said to be simple if each player has a finite set of types and each type has a distinct first-order belief about payoff states. We show that simple information structures are dense in the almost common knowledge topology and thus it is without loss to restrict attention to simple information structures in information design problems.

econ.TH↗

arXiv2024

Generalized Skyrmions

Skyrmions are important topologically non-trivial fields characteristic of models spanning scales from the microscopic to the cosmological. However, the Skyrmion number can only be defined for fields with specific boundary conditions, limiting its use in broader contexts. Here, we address this issue through a generalized notion of the Skyrmion derived from the De Rham cohomology of compactly supported forms. This allows for the definition of an entirely new $\coprod_{i=1}^\infty \mathbb{Z}^i$-valued topological number that assigns a tuple of integers $(a_1, \ldots, a_k)\in \mathbb{Z}^k$ to a field instead of a single number, with no restrictions to its boundary. The notion of the generalized Skyrmion presented in this paper is completely abstract and can be applied to vector fields in any discipline, not unlike index theory within dynamical systems. To demonstrate the power of our new formalism, we focus on the propagation of optical polarization fields and show that our newly defined generalized Skyrmion number significantly increases the dimension of data that can be stored within the field while also demonstrating strong robustness. Our work represents a fundamental paradigm shift away from the study of fields with natural topological character to engineered fields that can be artificially embedded with topological structures.

physics.optics↗

arXiv2023

The Optimality of Constant Mark-Up Pricing

We consider a nonlinear pricing environment with private information. We provide profit guarantees (and associated mechanisms) that the seller can achieve across all possible distributions of willingness to pay of the buyers. With a constant elasticity cost function, constant markup pricing provides the optimal revenue guarantee across all possible distributions of willingness to pay and the lower bound is attained under a Pareto distribution. We characterize how profits and consumer surplus vary with the distribution of values and show that Pareto distributions are extremal. We also provide a revenue guarantee for general cost functions. We establish equivalent results for optimal procurement policies that support maximal surplus guarantees for the buyer given all possible cost distributions of the sellers.

econ.TH↗

arXiv2022

Screening with Persuasion

We analyze a nonlinear pricing model where the seller controls both product pricing (screening) and buyer information about their own values (persuasion). We prove that the optimal mechanism always consists of finitely many signals and items, even with a continuum of buyer values. The seller optimally pools buyer values and reduces product variety to minimize informational rents. We show that value pooling is optimal even for finite value distributions if their entropy exceeds a critical threshold. We also provide sufficient conditions under which the optimal menu restricts offering to a single item.

econ.TH↗

arXiv2020

Expectations, Networks, and Conventions

In coordination games and speculative over-the-counter financial markets, solutions depend on higher-order average expectations: agents' expectations about what counterparties, on average, expect their counterparties to think, etc. We offer a unified analysis of these objects and their limits, for general information structures, priors, and networks of counterparty relationships. Our key device is an interaction structure combining the network and agents' beliefs, which we analyze using Markov methods. This device allows us to nest classical beauty contests and network games within one model and unify their results. Two applications illustrate the techniques: The first characterizes when slight optimism about counterparties' average expectations leads to contagion of optimism and extreme asset prices. The second describes the tyranny of the least-informed: agents coordinating on the prior expectations of the one with the worst private information, despite all having nearly common certainty, based on precise private signals, of the ex post optimal action.

econ.TH↗

arXiv2011

Lift and drag forces on an inclined plow moving over a granular surface

We studied the drag and lift forces acting on an inclined plate while it is dragged on the surface of a granular media, both in experiment and numerical simulation. In particular, we investigated the influence of the horizontal velocity of the plate and its angle of attack. We show that a steady wedge of grains is moved in front of the plow and that the lift and drag forces are proportional to the weight of this wedge. These constants of proportionality vary with the angle of attack but not (or only weakly) on the velocity. We found a universal effective friction law which accounts for the dependence on all the above-mentioned parameters. The stress and velocity fields are calculated from the numerical simulations and show the existence of a shear band under the wedge and that the pressure is non-hydrostatic. The strongest gradients in stress and shear occur at the base of the plow where the dissipation rate is therefore highest.

cond-mat.soft↗

arXiv2009

String-Like Lagrangians from a Generalized Geometry

This note will use Hitchin's generalized geometry and a model of axionic gravity developed by Warren Siegel in the mid-nineties to show that the construction of Lagrangians based on the inner product arising from the pairing of a vector and its dual can lead naturally to the low-energy Lagrangian of the bosonic string.

hep-th↗

arXiv2004

Non-perturbative vacua for M-theory on G2 manifolds

We study moduli stabilization in the context of M-theory on compact manifolds with G2 holonomy, using superpotentials from flux and membrane instantons, and recent results for the Khaeler potential of such models. The existence of minima with negative cosmological constant, stabilizing all moduli, is established. While most of these minima preserve supersymmetry, we also find examples with broken supersymmetry. Supersymmetric vacua with vanishing cosmological constant can also be obtained after a suitable tuning of parameters.

hep-th↗

arXiv2003

Kahler Potential for M-theory on a G_2 Manifold

We compute the moduli Kahler potential for M-theory on a compact manifold of G_2 holonomy in a large radius approximation. Our method relies on an explicit G_2 structure with small torsion, its periods and the calculation of the approximate volume of the manifold. As a verification of our result, some of the components of the Kahler metric are computed directly by integration over harmonic forms. We also discuss the modification of our result in the presence of co-dimension four singularities and derive the gauge-kinetic functions for the massless gauge fields that arise in this case.

hep-th↗

arXiv2003

Rolling G_2 Moduli

We study the time evolution of freely rolling moduli in the context of M-theory on a G_2 manifold. This free evolution approximates the correct dynamics of the system at sufficiently large values of the moduli when effects from non-perturbative potentials and flux are negligible. Moduli fall into two classes, namely bulk moduli and blow-up moduli. We obtain a number of non-trivial solutions for the time-evolution of these moduli. As a generic feature, we find the blow-up moduli always expand asymptotically at early and late time.

hep-th↗

arXiv2002

Towards a Realistic Picture of CP Violation in Heterotic String Models

We find that dilaton dominated supersymmetry breaking and spontaneous CP violation can be achieved in heterotic string models with superpotentials singular at the fixed points of the modular group. A semi--realistic picture of CP violation emerges in such models: the CKM phase appears due to a complex VEV of the T-modulus, while the soft supersymmetric CP phases are absent due to an axionic--type symmetry.

hep-th↗