English
Related papers

Related papers: The Revealed Preference Theory of Aggregate Object…

200 papers

We consider a combinatorial auction model where preferences of agents over bundles of objects and payments need not be quasilinear. However, we restrict the preferences of agents to be dichotomous. An agent with dichotomous preference…

Theoretical Economics · Economics 2022-02-22 Komal Malik , Debasis Mishra

We study mechanisms for an allocation of goods among agents, where agents have no incentive to lie about their true values (incentive compatible) and for which no agent will seek to exchange outcomes with another (envy-free). Mechanisms…

Computer Science and Game Theory · Computer Science 2010-03-30 Edith Cohen , Michal Feldman , Amos Fiat , Haim Kaplan , Svetlana Olonetsky

We study the problem of finding fair and efficient allocations of a set of indivisible items to a set of agents, where each item may be a good (positively valued) for some agents and a bad (negatively valued) for others, i.e., a mixed…

Computer Science and Game Theory · Computer Science 2022-02-08 Vasilis Livanos , Ruta Mehta , Aniket Murhekar

We study the fair division problem of allocating $m$ indivisible goods to $n$ agents with additive personalized bi-valued utilities. Specifically, each agent $i$ assigns one of two positive values $a_i > b_i > 0$ to each good, indicating…

Computer Science and Game Theory · Computer Science 2025-10-20 Jiarong Jin , Biaoshuai Tao

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

Combinatorial preference aggregation has many applications in AI. Given the exponential nature of these preferences, compact representations are needed and ($m$)CP-nets are among the most studied ones. Sequential and global voting are two…

Artificial Intelligence · Computer Science 2019-03-28 Thomas Lukasiewicz , Enrico Malizia

We study the computational complexity of finding a competitive equilibrium (CE) with chores when agents have linear preferences. CE is one of the most preferred mechanisms for allocating a set of items among agents. CE with equal incomes…

Computer Science and Game Theory · Computer Science 2022-05-24 Bhaskar Ray Chaudhury , Jugal Garg , Peter McGlaughlin , Ruta Mehta

Ensuring efficiency and envy-freeness in allocating indivisible goods without money often requires randomization. However, existing combinatorial assignment mechanisms (for applications such as course allocation, food banks, and refugee…

Theoretical Economics · Economics 2025-10-03 Thành Nguyen , Alexander Teytelboym , Shai Vardi

We study allocation problems without monetary transfers where agents have correlated types, i.e., hold private information about one another. Such peer information is relevant in various settings, including science funding, allocation of…

Theoretical Economics · Economics 2025-03-21 Axel Niemeyer , Justus Preusser

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

We study the classic problem of dividing a collection of indivisible resources in a fair and efficient manner among a set of agents having varied preferences. Pareto optimality is a standard notion of economic efficiency, which states that…

Computer Science and Game Theory · Computer Science 2023-07-25 Ioannis Caragiannis , Kristoffer Arnsfelt Hansen , Nidhi Rathi

Recommender system based on historical user-item interactions is of vital importance for web-based services. However, the observed data used to train the recommender model suffers from severe bias issues. Practically, the item frequency…

Information Retrieval · Computer Science 2025-03-04 Yule Wang , Xin Xin , Yue Ding , Yunzhe Li , Dong Wang

Approximate Competitive Equilibrium from Equal Incomes (A-CEEI) is an equilibrium-based solution concept for fair division of discrete items to agents with combinatorial demands. In theory, it is known that in asymptotically large markets:…

Computer Science and Game Theory · Computer Science 2023-06-01 Eric Budish , Ruiquan Gao , Abraham Othman , Aviad Rubinstein , Qianfan Zhang

An inconsistent knowledge base can be abstracted as a set of arguments and a defeat relation among them. There can be more than one consistent way to evaluate such an argumentation graph. Collective argument evaluation is the problem of…

Artificial Intelligence · Computer Science 2017-06-20 Edmond Awad , Martin Caminada , Gabriella Pigozzi , Mikołaj Podlaszewski , Iyad Rahwan

We propose a theoretical framework under which preference profiles can be meaningfully compared. Specifically, given a finite set of feasible allocations and a preference profile, we first define a ranking vector of an allocation as the…

Theoretical Economics · Economics 2023-04-11 Wayne Yuan Gao

Envy-freeness up to any good (EFX) provides a strong and intuitive guarantee of fairness in the allocation of indivisible goods. But whether such allocations always exist or whether they can be efficiently computed remains an important open…

Computer Science and Game Theory · Computer Science 2020-12-16 Hadi Hosseini , Sujoy Sikdar , Rohit Vaish , Lirong Xia

We study notions of fairness in decision-making systems when individuals have diverse preferences over the possible outcomes of the decisions. Our starting point is the seminal work of Dwork et al. which introduced a notion of individual…

Machine Learning · Computer Science 2019-09-12 Michael P. Kim , Aleksandra Korolova , Guy N. Rothblum , Gal Yona

Fashion is an important part of human experience. Events such as interviews, meetings, marriages, etc. are often based on clothing styles. The rise in the fashion industry and its effect on social influencing have made outfit compatibility…

Computer Vision and Pattern Recognition · Computer Science 2020-08-06 Dikshant Sagar , Jatin Garg , Prarthana Kansal , Sejal Bhalla , Rajiv Ratn Shah , Yi Yu

LLMs are increasingly used to make or support high-stakes decisions under uncertainty, where alignment depends not only on factual accuracy but on how models weigh tradeoffs between different outcomes. We present an empirical pipeline for…

Machine Learning · Computer Science 2026-05-12 Khurram Yamin , Jingjing Tang , Eric Horvitz , Bryan Wilder

We present a simple and natural non-pricing mechanism for allocating divisible goods among strategic agents having lexicographic preferences. Our mechanism has favorable properties of incentive compatibility (strategy-proofness), Pareto…

Computer Science and Game Theory · Computer Science 2017-02-17 Leonard J. Schulman , Vijay V. Vazirani