English
Related papers

Related papers: Formal Power Series Representations in Probability…

200 papers

We study preferences estimated from finite choice experiments and provide sufficient conditions for convergence to a unique underlying "true" preference. Our conditions are weak, and therefore valid in a wide range of economic environments.…

Theoretical Economics · Economics 2020-11-03 Christopher P. Chambers , Federico Echenique , Nicolas Lambert

This paper presents a comprehensive formalization of the von Neumann-Morgenstern (vNM) expected utility theorem using the Lean 4 interactive theorem prover. We implement the classical axioms of preference-completeness, transitivity,…

Theoretical Economics · Economics 2025-06-10 Li Jingyuan

A representation embedding between cartesian theories can be defined to be a functor between respective categories of models that preserves finitely-generated projective models and that preserves and reflects certain epimorphisms. This…

Representation Theory · Mathematics 2017-11-09 Michael Lambert

We introduce A-ranked preferential structures and combine them with an accessibility relation. This framework allows us to formalize contrary to duty obligations. Representation results are proved.

Logic · Mathematics 2008-08-25 Dov Gabbay , Karl Schlechta

The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…

Complex Variables · Mathematics 2015-05-06 Jorge L. deLyra

Diversification represents the idea of choosing variety over uniformity. Within the theory of choice, desirability of diversification is axiomatized as preference for a convex combination of choices that are equivalently ranked. This…

Economics · Quantitative Finance 2016-10-07 Enrico G. De Giorgi , Ola Mahmoud

We consider the theory of algebraically closed fields of characteristic zero with multivalued operations $x\mapsto x^r$ (raising to powers). It is in fact the theory of equations in exponential sums. In an earlier paper we have described…

Logic · Mathematics 2015-01-15 Boris Zilber

Expected Utility: Algebraic Expected Utility In this paper, we provide two axiomatizations of algebraic expected utility, which is a particular generalized expected utility, in a von Neumann-Morgenstern setting, i.e. uncertainty…

Artificial Intelligence · Computer Science 2012-07-02 Paul Weng

Representations are essential to mathematically model phenomena, but there are many options available. While each of those options provides useful properties with which to solve problems related to the phenomena in study, comparing results…

Logic in Computer Science · Computer Science 2025-10-01 Luke Bayzid , Alexandre Madeira , Manuel A. Martins

The famous Afriat's theorem from the theory of revealed preferences establishes necessary and suffient conditions for existence of utility function for a given set of choices and prices. The result on existence of a {\it homogeneous}…

Optimization and Control · Mathematics 2014-05-27 Alexander V. Kolesnikov , Olga V. Kudryavtseva , Tigran Nagapetyan

In this paper, we consider the problem of learning a first-order theorem prover that uses a representation of beliefs in mathematical claims to construct proofs. The inspiration for doing so comes from the practices of human mathematicians…

Artificial Intelligence · Computer Science 2019-07-01 Daniel Huang

We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…

Logic · Mathematics 2015-03-05 Norman Feldman

Lurie's representability theorem gives necessary and sufficient conditions for a functor to be an almost finitely presented derived geometric stack. We establish several variants of Lurie's theorem, making the hypotheses easier to verify…

Algebraic Geometry · Mathematics 2014-09-08 J. P. Pridham

We extend de Finetti's [Ann. Inst. H. Poincar\'{e} 7 (1937) 1--68] notion of exchangeability to finite and countable sequences of variables, when a subject's beliefs about them are modelled using coherent lower previsions rather than…

Probability · Mathematics 2009-09-08 Gert de Cooman , Erik Quaeghebeur , Enrique Miranda

I introduce and study a new notion of Archimedeanity for binary and non-binary choice between options that live in an abstract Banach space, through a very general class of choice models, called sets of desirable option sets. In order to be…

Artificial Intelligence · Computer Science 2021-07-12 Gert de Cooman

Dependence on the parameter is continuous when perturbations of the parameter preserves strict preference for one alternative over another. We characterise this property via a utility function over alternatives that depends continuously on…

Computer Science and Game Theory · Computer Science 2019-04-01 Patrick H. O'Callaghan

We consider a model where a subset of candidates must be selected based on voter preferences, subject to general constraints that specify which subsets are feasible. This model generalizes committee elections with diversity constraints,…

Computer Science and Game Theory · Computer Science 2026-02-10 Piotr Skowron

Given a quantum system consisting of many parts, we show that symmetry of the system's state, i.e., invariance under swappings of the subsystems, implies that almost all of its parts are virtually identical and independent of each other.…

Quantum Physics · Physics 2011-11-09 Renato Renner

In this paper, we consider a model of classical linear logic based on coherence spaces endowed with a notion of totality. If we restrict ourselves to total objects, each coherence space can be regarded as a uniform space and each linear map…

Logic in Computer Science · Computer Science 2017-06-05 Kei Matsumoto

In this paper we present a transformation of finite propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter's default logic in the framework of…

Artificial Intelligence · Computer Science 2007-05-23 Dritan Berzati , Bernhard Anrig , Juerg Kohlas