English
Related papers

Related papers: Empirical Welfare Economics

200 papers

The classic house allocation problem is primarily concerned with finding a matching between a set of agents and a set of houses that guarantees some notion of economic efficiency (e.g. utilitarian welfare). While recent works have shifted…

Computer Science and Game Theory · Computer Science 2024-07-08 Hadi Hosseini , Medha Kumar , Sanjukta Roy

This paper examines optimal risk sharing for empirically realistic risk attitudes, providing results on Pareto optimality, competitive equilibria, utility frontiers, and the first and second theorems of welfare. Contrary to common…

Theoretical Economics · Economics 2025-10-06 Jean-Gabriel Lauzier , Liyuan Lin , Peter Wakker , Ruodu Wang

We study fair allocation of constrained resources, where a market designer optimizes overall welfare while maintaining group fairness. In many large-scale settings, utilities are not known in advance, but are instead observed after…

Computer Science and Game Theory · Computer Science 2024-11-06 Elita Lobo , Justin Payan , Cyrus Cousins , Yair Zick

To determine the welfare implications of price changes in demand data, we introduce a revealed preference relation over prices. We show that the absence of cycles in this relation characterizes a consumer who trades off the utility of…

Econometrics · Economics 2024-07-03 Rahul Deb , Yuichi Kitamura , John K. -H. Quah , Jörg Stoye

The First Fundamental Theorem of Welfare Economics assumes that welfare-bearing agents are autonomous and implicitly relies on a binary distinction between autonomy and instrumentality. Welfare subjects are those who have autonomy and…

Theoretical Economics · Economics 2026-04-24 Elija Perrier

Empirical Welfare Maximization (EWM) is a framework that can be used to select welfare program eligibility policies based on data. This paper extends EWM by allowing for uncertainty in estimating the budget needed to implement the selected…

Econometrics · Economics 2025-12-18 Liyang Sun

We study the allocation of indivisible items that form an undirected graph and investigate the worst-case welfare loss when requiring that each agent must receive a connected subgraph. Our focus is on both egalitarian and utilitarian…

Computer Science and Game Theory · Computer Science 2026-01-21 Xiaohui Bei , Alexander Lam , Xinhang Lu , Warut Suksompong

Information policies such as scores, ratings, and recommendations are increasingly shaping society's choices in high-stakes domains. We provide a framework to study the welfare implications of information policies on a population of…

Theoretical Economics · Economics 2023-09-06 Laura Doval , Alex Smolin

Based on the observation that many existing discrete choice models admit a welfare function of utilities whose gradient gives the choice probability vector, we propose a new representation of discrete choice model which we call the…

Optimization and Control · Mathematics 2015-03-09 Guiyun Feng , Xiaobo Li , Zizhuo Wang

We study the problem of allocating indivisible items to budget-constrained agents, aiming to provide fairness and efficiency guarantees. Specifically, our goal is to ensure that the resulting allocation is envy-free up to any item (EFx)…

Computer Science and Game Theory · Computer Science 2023-08-04 Marius Garbea , Vasilis Gkatzelis , Xizhi Tan

We characterize Pareto optimality via "near" weighted utilitarian welfare maximization. One characterization sequentially maximizes utilitarian welfare functions using a finite sequence of nonnegative and eventually positive welfare…

Theoretical Economics · Economics 2023-03-28 Yeon-Koo Che , Jinwoo Kim , Fuhito Kojima , Christopher Thomas Ryan

Envy-freeness and Pareto Efficiency are two major goals in welfare economics. The existence of an allocation that satisfies both conditions has been studied for a long time. Whether items are indivisible or divisible, it is impossible to…

Computer Science and Game Theory · Computer Science 2019-11-11 Richard Cole , Yixin Tao

We study the fundamental problem of allocating indivisible goods to agents with additive preferences. We consider eliciting from each agent only a ranking of her $k$ most preferred goods instead of her full cardinal valuations. We…

Computer Science and Game Theory · Computer Science 2021-05-25 Daniel Halpern , Nisarg Shah

We propose a new model for aggregating preferences over a set of indivisible items based on a quantile value. In this model, each agent is endowed with a specific quantile, and the value of a given bundle is defined by the corresponding…

Computer Science and Game Theory · Computer Science 2026-05-06 Haris Aziz , Shivika Narang , Mashbat Suzuki

To choose between two discrete goods, a consumer pays attention to only those with prices below a threshold. From these, she chooses her most preferred good. We assume consumers in a population have the same preference but may have…

Theoretical Economics · Economics 2025-11-07 Kaushil Patel

We consider a simple sequential allocation procedure for sharing indivisible items between agents in which agents take turns to pick items. Supposing additive utilities and independence between the agents, we show that the expected utility…

Artificial Intelligence · Computer Science 2013-04-24 Thomas Kalinowski , Nina Nardoytska , Toby Walsh

We present a recommender system based on the Random Utility Model. Online shoppers are modeled as rational decision makers with limited information, and the recommendation task is formulated as the problem of optimally enriching the…

Computer Science and Game Theory · Computer Science 2024-09-24 Benjamin Heymann , Flavian Vasile , David Rohde

The econometric literature on treatment-effects typically takes functionals of outcome-distributions as `social welfare' and ignores program-impacts on unobserved utilities. We show how to incorporate aggregate utility within econometric…

Econometrics · Economics 2022-11-21 Debopam Bhattacharya , Tatiana Komarova

Sequential allocation is a simple and attractive mechanism for the allocation of indivisible goods. Agents take turns, according to a policy, to pick items. Sequential allocation is guaranteed to return an allocation which is efficient but…

Artificial Intelligence · Computer Science 2018-01-17 Haris Aziz , Thomas Kalinowski , Toby Walsh , Lirong Xia

We study fair resource allocation under a connectedness constraint wherein a set of indivisible items are arranged on a path and only connected subsets of items may be allocated to the agents. An allocation is deemed fair if it satisfies…

Computer Science and Game Theory · Computer Science 2021-01-27 Neeldhara Misra , Chinmay Sonar , P. R. Vaidyanathan , Rohit Vaish
‹ Prev 1 2 3 10 Next ›