English
Related papers

Related papers: Nonlinear desirability theory

200 papers

Bayesian probability theory is used to analyze the oft-made assumption that humans are typical observers in the universe. Some theoretical calculations make the {\it selection fallacy} that we are randomly chosen from a class of objects by…

High Energy Physics - Theory · Physics 2008-11-26 James B. Hartle , Mark Srednicki

We develop efficient algorithms to construct utility maximizing mechanisms in the presence of risk averse players (buyers and sellers) in Bayesian settings. We model risk aversion by a concave utility function, and players play…

Computer Science and Game Theory · Computer Science 2012-06-28 Anand Bhalgat , Tanmoy Chakraborty , Sanjeev Khanna

A rapidly growing literature on lying in behavioral economics and psychology shows that individuals often do not lie even when lying maximizes their utility. In this work, we attempt to incorporate these findings into the theory of…

Computer Science and Game Theory · Computer Science 2021-11-23 Shahar Dobzinski , Sigal Oren

The results in this paper add useful tools to the theory of sets of desirable gambles, a growing toolbox for reasoning with partial probability assessments. We investigate how to combine a number of marginal coherent sets of desirable…

Artificial Intelligence · Computer Science 2014-02-05 Gert de Cooman , Enrique Miranda

The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the…

Logic in Computer Science · Computer Science 2015-07-01 Jean-Louis Krivine

As recommender systems are being designed and deployed for an increasing number of socially-consequential applications, it has become important to consider what properties of fairness these systems exhibit. There has been considerable…

Information Retrieval · Computer Science 2020-09-08 Nasim Sonboli , Robin Burke , Nicholas Mattei , Farzad Eskandanian , Tian Gao

We provide an axiomatic foundation for the representation of num\'{e}raire-invariant preferences of economic agents acting in a financial market. In a static environment, the simple axioms turn out to be equivalent to the following choice…

General Finance · Quantitative Finance 2010-11-09 Constantinos Kardaras

Explore-and-exploit tradeoffs play a key role in recommendation systems (RSs), aiming at serving users better by learning from previous interactions. Despite their commercial success, the societal effects of explore-and-exploit mechanisms…

Computer Science and Game Theory · Computer Science 2025-02-19 Omer Ben-Porat , Yotam Gafni , Or Markovetzki

We consider the egalitarian welfare aspects of random assignment mechanisms when agents have unrestricted cardinal utilities over the objects. We give bounds on how well different random assignment mechanisms approximate the optimal…

Computer Science and Game Theory · Computer Science 2015-07-27 Haris Aziz , Jiashu Chen , Aris Filos-Ratsikas , Simon Mackenzie , Nicholas Mattei

We advance a general theory of coherent preference that surrenders restrictions embodied in orthodox doctrine. This theory enjoys the property that any preference system admits extension to a complete system of preferences, provided it…

Probability · Mathematics 2025-08-04 Arthur Paul Pedersen , Samuel Allen Alexander

As operators acting on the undetermined final settlement of a derivative security, expectation is linear but price is non-linear. When the market of underlying securities is incomplete, non-linearity emerges from the bid-offer around the…

Mathematical Finance · Quantitative Finance 2025-09-23 Paul McCloud

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

The Probabilistic Serial mechanism is well-known for its desirable fairness and efficiency properties. It is one of the most prominent protocols for the random assignment problem. However, Probabilistic Serial is not incentive-compatible,…

Computer Science and Game Theory · Computer Science 2020-01-30 Zihe Wang , Zhide Wei , Jie Zhang

This paper studies a general class of social choice problems in which agents' payoff functions (or types) are privately observable random variables, and monetary transfers are not available. We consider cardinal social choice functions…

Theoretical Economics · Economics 2024-08-20 Kazuya Kikuchi , Yukio Koriyama

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,…

Theoretical Economics · Economics 2024-08-09 Peter Caradonna , Christopher P. Chambers

Consider a game where Alice generates an integer and Bob wins if he can factor that integer. Traditional game theory tells us that Bob will always win this game even though in practice Alice will win given our usual assumptions about the…

Computer Science and Game Theory · Computer Science 2009-11-18 Lance Fortnow , Rahul Santhanam

We propose and axiomatize a new model of incomplete preferences under uncertainty, which we call \textit{hope-and-prepare preferences}. An act is considered more desirable than an other act when, and only when, both an optimistic…

Theoretical Economics · Economics 2025-07-29 Pierre Bardier , Bach Dong-Xuan , Van-Quy Nguyen

We provide a theoretical framework to understand how widely used measures of choice difficulty relate. In a binary-option Bayesian expected-utility framework, we show that three measures of difficulty, (i) understanding (ex-ante value),…

Theoretical Economics · Economics 2026-04-30 Chris Chambers , Yusufcan Masatolioglu , Paulo Natenzon , Collin Raymond

We revisit the foundations of fairness and its interplay with utility and efficiency in settings where the training data contain richer labels, such as individual types, rankings, or risk estimates, rather than just binary outcomes. In this…

Machine Learning · Computer Science 2025-05-23 Noga Amit , Omer Reingold , Guy N. Rothblum

We consider finite games in strategic form with Choquet expected utility. Using the notion of (unambiguously) believed, we define Choquet rationalizability and characterize it by Choquet rationality and common beliefs in Choquet rationality…

Computer Science and Game Theory · Computer Science 2019-07-23 Adam Dominiak , Burkhard Schipper