相关论文: A Representation Theorem for Finite Best-Worst Ran…

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

This paper proves the approximate intermediate value theorem, constructively and from notably weak hypotheses: from pointwise rather than uniform continuity, without assuming that reals are presented with rational approximants, and without…

We give two generalizations of Kac's Theorem on representations of quivers. One is to representations of equipped graphs by relations, in the sense of Gelfand and Ponomarev. The other is to representations of quivers in which certain of the…

In recent years there has been a spate of papers describing systems for probabilisitic reasoning which do not use numerical probabilities. In some cases the simple set of values used by these systems make it impossible to predict how a…

Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stochastic variation of the composite likelihood function. Each of…

When it comes to structural estimation of risk preferences from data on choices, random utility models have long been one of the standard research tools in economics. A recent literature has challenged these models, pointing out some…

In this paper we study a robust expected utility maximization problem with random endowment in discrete time. We give conditions under which an optimal strategy exists and derive a dual representation for the optimal utility. Our approach…

We provide an axiomatic system modeling conditional preference orders which is based on conditional set theory. Conditional numerical representations are introduced, and a conditional version of the theorems of Debreu on the existence of…

In this paper, the Neyman-Pearson lemma for general sublinear expectations is studied. We weaken the assumptions for sublinear expectations in [1] and give a completely new method to study this problem. Applying Mazur-Orlicz Theorem and the…

Motivated by problems involving end extensions of models of set theory, we develop the rudiments of the power admissible cover construction (over ill-founded models of set theory), an extension of the machinery of admissible covers invented…

We prove existence and uniqueness of stochastic equilibria in a class of incomplete continuous-time financial environments where the market participants are exponential utility maximizers with heterogeneous risk-aversion coefficients and…

We prove an effective version of the Oppenheim conjecture with a polynomial error rate. The proof is based on an effective equidistribution theorem which in turn relies on recent progress towards restricted projection problem.

We define the min-min expectation selection problem (resp. max-min expectation selection problem) to be that of selecting k out of n given discrete probability distributions, to minimize (resp. maximize) the expectation of the minimum value…

Central to model selection is a trade-off between performing a good fit and low model complexity: A model of higher complexity should only be favoured over a simpler model if it provides significantly better fits. In Bayesian terms, this…

We consider the problem of rationalizing choice data by a preference satisfying an arbitrary collection of invariance axioms. Examples of such axioms include quasilinearity, homotheticity, independence-type axioms for mixture spaces,…

It has been proposed in medical decision analysis to express the ``first do no harm'' principle as an asymmetric utility function in which the loss from killing a patient would count more than the gain from saving a life. Such a utility…

We consider optimization of nonlinear objective functions that balance $d$ linear criteria over $n$-element independence systems presented by linear-optimization oracles. For $d=1$, we have previously shown that an $r$-best approximate…

The famous Bernstein conjecture about optimal node systems in classical polynomial Lagrange interpolation, standing unresolved for about half a century, was solved by T. Kilgore in 1978. Immediately following him, also the additional…

We consider a variable selection problem for the prediction of binary outcomes. We study the best subset selection procedure by which the covariates are chosen by maximizing Manski (1975, 1985)'s maximum score objective function subject to…

Explicit expressions for the Temperley-Lieb-Martin algebras, i.e., the quotients of the Hecke algebra that admit only representations corresponding to Young diagrams with a given maximum number of columns (or rows), are obtained, making…