Zobrazeno 1 - 10
of 285
pro vyhledávání: '"Marinacci, Massimo"'
Autor:
Cerreia-Vioglio, Simone, Maccheroni, Fabio, Marinacci, Massimo, Montrucchio, Luigi, Stanca, Lorenzo
This paper presents a general study of one-dimensional differentiability for functionals on convex domains that are not necessarily open. The local approximation is carried out by affine functionals, rather than linear ones as in standard Gateaux dif
Externí odkaz:
http://arxiv.org/abs/2403.07827
We provide a new foundation of risk aversion by showing that the propension to exploit insurance opportunities fully describes this attitude. Our foundation, which applies to any probabilistically sophisticated preference, well accords with the commo
Externí odkaz:
http://arxiv.org/abs/2310.09173
We show that a normalized capacity $\nu: \mathcal{P}(\mathbf{N})\to \mathbf{R}$ is invariant with respect to an ideal $\mathcal{I}$ on $\mathbf{N}$ if and only if it can be represented as a Choquet average of $\{0,1\}$-valued finitely additive probab
Externí odkaz:
http://arxiv.org/abs/2307.16823
We develop a full-fledged analysis of an algorithmic decision process that, in a multialternative choice problem, produces computable choice probabilities and expected decision times.
Externí odkaz:
http://arxiv.org/abs/2305.03645
We study the implications of recursivity and state monotonicity in intertemporal consumption problems under ambiguity. We show that monotone recursive preferences admit a recursive and ex-ante representation, both with translation invariant certainty
Externí odkaz:
http://arxiv.org/abs/2304.06830
We use decision theory to confront uncertainty that is sufficiently broad to incorporate "models as approximations." We presume the existence of a featured collection of what we call "structured models" that have explicit substantive motivations. The
Externí odkaz:
http://arxiv.org/abs/2008.01071
Simulated Annealing is the crowning glory of Markov Chain Monte Carlo Methods for the solution of NP-hard optimization problems in which the cost function is known. Here, by replacing the Metropolis engine of Simulated Annealing with a reinforcement
Externí odkaz:
http://arxiv.org/abs/2008.00234
Autor:
Cerreia-Vioglio, Simone, Lindberg, Per Olov, Maccheroni, Fabio, Marinacci, Massimo, Rustichini, Aldo
We prove that a random choice rule satisfies Luce's Choice Axiom if and only if its support is a choice correspondence that satisfies the Weak Axiom of Revealed Preference, thus it consists of alternatives that are optimal according to some preferenc
Externí odkaz:
http://arxiv.org/abs/2007.11386
The Boltzmann distribution describes a single parameter (temperature) family of probability distributions over a state space; at any given temperature, the ratio of probabilities of two states depends on their difference in energy. The same family is
Externí odkaz:
http://arxiv.org/abs/2006.15970
Autor:
Baldassi, Carlo, Cerreia-Vioglio, Simone, Maccheroni, Fabio, Marinacci, Massimo, Pirazzini, Marco
We introduce an algorithmic decision process for multialternative choice that combines binary comparisons and Markovian exploration. We show that a preferential property, transitivity, makes it testable.
Externí odkaz:
http://arxiv.org/abs/2005.01081