English
Related papers

Related papers: Posterior-Separable Costs and Menu Preferences

200 papers

We introduce the notion of a multidimensional hybrid preference domain on a (finite) set of alternatives that is a Cartesian product of finitely many components. We demonstrate that in a model of public goods provision, multidimensional…

Theoretical Economics · Economics 2023-11-17 Shurojit Chatterji , Huaxia Zeng

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

We study the fair allocation of indivisible resources among agents. Most prior work focuses on fairness and/or efficiency among agents. However, the allocator, as the resource owner, may also be involved in many scenarios (e.g., government…

Computer Science and Game Theory · Computer Science 2025-06-10 Xiaolin Bu , Zihao Li , Shengxin Liu , Jiaxin Song , Biaoshuai Tao

The problem of fair division known as "cake cutting" has been the focus of multiple papers spanning several decades. The most prominent problem in this line of work has been to bound the query complexity of computing an envy-free outcome in…

Computer Science and Game Theory · Computer Science 2022-01-14 Ioannis Caragiannis , Vasilis Gkatzelis , Alexandros Psomas , Daniel Schoepflin

We study existence, uniqueness and computability of solutions for a class of discrete time recursive utilities models. By combining two streams of the recent literature on recursive preferences---one that analyzes principal eigenvalues of…

Economics · Quantitative Finance 2019-04-24 Jaroslav Borovicka , John Stachurski

A principal wishes to transact business with a multidimensional distribution of agents whose preferences are known only in the aggregate. Assuming a twist (= generalized Spence-Mirrlees single-crossing) hypothesis and that agents can choose…

Optimization and Control · Mathematics 2009-12-17 Alessio Figalli , Young-Heon Kim , Robert J. McCann

A group of $n$ agents with numerical preferences for each other are to be assigned to the $n$ seats of a dining table. We study two natural topologies:~circular (cycle) tables and panel (path) tables. For a given seating arrangement, an…

Computer Science and Game Theory · Computer Science 2023-10-10 Damien Berriaud , Andrei Constantinescu , Roger Wattenhofer

We propose indifference pricing to estimate the value of the weak information. Our framework allows for tractability, quantifying the amount of additional information, and permits the description of the smallness and the stability with…

Mathematical Finance · Quantitative Finance 2024-08-06 Fabrice Baudoin , Oleksii Mostovyi

A principal screens an agent with an arbitrary set of allocations $X$. The agent's preferences over allocations are comonotonic. A subset of allocations $X^*\subseteq X$ is a surplus-elasticity frontier if (i) any other allocation has a…

Theoretical Economics · Economics 2026-02-24 Frank Yang

We propose a novel system for action sequence planning based on a combination of affordance recognition and a neural forward model predicting the effects of affordance execution. By performing affordance recognition on predicted futures, we…

Robotics · Computer Science 2022-06-23 Solvi Arnold , Mami Kuroishi , Tadashi Adachi , Kimitoshi Yamazaki

We study mechanism design when agents may have hidden secondary goals which will manifest as non-trivial preferences among outcomes for which their primary utility is the same. We show that in such cases, a mechanism is robust against…

Computer Science and Game Theory · Computer Science 2023-07-25 Renato Paes Leme , Jon Schneider , Hanrui Zhang

The worthwhile-to-move incremental principle is a mechanism where, at each step, the agent, before moving and after exploration around the current state, compares intermediate advantages and costs to change to advantages and costs to stay.…

Optimization and Control · Mathematics 2009-05-11 Hedy Attouch , Antoine Soubeyran

Consider the sequential testing of binary outcomes. The a posteriori belief process and its objective conditional-probability counterpart generally differ but converge to the same result in well-defined tests. We show that unless the two…

Statistics Theory · Mathematics 2026-02-20 Kangda K. Wren

As a firm varies the price of a product, consumers exhibit reference effects, making purchase decisions based not only on the prevailing price but also the product's price history. We consider the problem of learning such behavioral…

Computer Science and Game Theory · Computer Science 2017-08-31 Abbas Kazerouni , Benjamin Van Roy

In the setting of sequential prediction of individual $\{0, 1\}$-sequences with expert advice, we show that by allowing the learner to abstain from the prediction by paying a cost marginally smaller than $\frac 12$ (say, $0.49$), it is…

Machine Learning · Computer Science 2020-06-23 Gergely Neu , Nikita Zhivotovskiy

We explore the fair distribution of a set of $m$ indivisible chores among $n$ agents, where each agent's costs are evaluated using a monotone cost function. Our focus lies on two fairness criteria: envy-freeness up to any item (EFX) and a…

Computer Science and Game Theory · Computer Science 2024-10-25 Mahyar Afshinmehr , Matin Ansaripour , Alireza Danaei , Kurt Mehlhorn

This paper formulates an utility indifference pricing model for investors trading in a discrete time financial market under non-dominated model uncertainty. The investors preferences are described by strictly increasing concave random…

Mathematical Finance · Quantitative Finance 2020-10-05 Romain Blanchard , Laurence Carassus

We show that many models of choice can be alternatively represented as special cases of choice with limited attention (Masatlioglu, Nakajima, and Ozbay, 2012), singling out the properties of the unobserved attention filters that explain the…

Theoretical Economics · Economics 2025-07-31 Davide Carpentiere , Angelo Petralia

Most of the literature on online algorithms in revenue management focuses on settings with irrevocable decisions, where once a decision is made upon the arrival of a new input, it cannot be canceled later. Motivated by modern applications…

Data Structures and Algorithms · Computer Science 2025-04-22 Farbod Ekbatani , Rad Niazadeh , Pranav Nuti , Jan Vondrak

In several decision-making problems, alternatives should be ranked on the basis of paired comparisons between them. We present an axiomatic approach for the universal ranking problem with arbitrary preference intensities, incomplete and…

Computer Science and Game Theory · Computer Science 2019-04-10 László Csató
‹ Prev 1 4 5 6 7 8 10 Next ›