Mathematics of Operations Research

Nonmonetary mechanisms for repeated allocation and decision making are gaining widespread use in many real-world settings. Our aim in this work is to study the performance and incentive properties of simple mechanisms based on artificial currencies in ...

Each capacity-filling and substitutable choice rule is known to have a maximizer-collecting representation: There exists a list of priority orderings such that from each choice set that includes more alternatives than the capacity, the choice is the union ...

In a prior study [Ye HQ, Yao DD (2016) Diffusion limit of fair resource control–Stationary and interchange of limits. Math. Oper. Res. 41(4):1161–1207.] focusing on a class of stochastic processing network with fair resource control, we justified the ...

We propose a model in which dividend payments occur at regular, deterministic intervals in an otherwise continuous model. This contrasts traditional models where either the payment of continuous dividends is controlled or the dynamics are given by ...

Stochastic convex optimization, by which the objective is the expectation of a random convex function, is an important and widely used method with numerous applications in machine learning, statistics, operations research, and other areas. We study the ...

We study statistical inference and distributionally robust solution methods for stochastic optimization problems, focusing on confidence intervals for optimal values and solutions that achieve exact coverage asymptotically. We develop a generalized ...

We present a new type of unsupervised learning problem in which we find a small set of representative regions that approximates a larger data set. These regions may be presented to a practitioner along with additional information in order to help the ...

The multilinear polytope of a hypergraph is the convex hull of a set of binary points satisfying a collection of multilinear equations. We introduce the running intersection inequalities, a new class of facet-defining inequalities for the multilinear ...

We study the problem of fair allocation for indivisible goods. We use the maximin share paradigm introduced by Budish [Budish E (2011) The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. J. Political Econom. 119(6)...

We study time-varying semidefinite programs (TV-SDPs), which are semidefinite programs whose data (and solutions) are functions of time. Our focus is on the setting where the data vary polynomially with time. We show that under a strict feasibility ...

We present a new class of polynomial-time algorithms for submodular function minimization (SFM) as well as a unified framework to obtain strongly polynomial SFM algorithms. Our algorithms are based on simple iterative methods for the minimum-norm problem, ...

The notion of “tail risk” has been a crucial consideration in modern risk management and financial regulation, as very well documented in the recent regulatory documents. To achieve a comprehensive understanding of the tail risk, we carry out an axiomatic ...

This paper shows that the self-concordance parameter of the universal barrier on any n-dimensional proper convex domain is upper bounded by n. This bound is tight and improves the previous O(n) bound by Nesterov and Nemirovski. The key to our main result ...

We introduce a new notion of conditional nonlinear expectation under probability distortion. Such a distorted nonlinear expectation is not subadditive in general, so it is beyond the scope of Peng’s framework of nonlinear expectations. A more fundamental ...

We propose a connection between finite zero-sum stochastic games (henceforth stochastic games) and multiparameter eigenvalue problems. This connection, which relies on the theory developed by Shapley and Snow for matrix games, opens new possibilities in ...

We consider a model of intertemporal choice where time is a continuum, the set of instantaneous outcomes (e.g., consumption bundles) is a topological space, and intertemporal plans (e.g., consumption streams) must be continuous functions of time. We ...

This corrigendum fixes an incorrect claim in the paper Gupta et al. [Gupta V, Moseley B, Uetz M, Xie Q (2020) Greed works—online algorithms for unrelated machine stochastic scheduling. Math. Oper. Res. 45(2):497–516.], which led us to claim a performance ...