English
Related papers

Related papers: Dividing goods or bads under additive utilities

200 papers

Goods and services -- public housing, medical appointments, schools -- are often allocated to individuals who rank them similarly but differ in their preference intensities. We characterize optimal allocation rules when individual…

Theoretical Economics · Economics 2021-08-30 Pietro Ortoleva , Evgenii Safonov , Leeat Yariv

A collection of objects, some of which are good and some are bad, is to be divided fairly among agents with different tastes, modeled by additive utility functions. If the objects cannot be shared, so that each of them must be entirely…

Computer Science and Game Theory · Computer Science 2022-11-10 Fedor Sandomirskiy , Erel Segal-Halevi

We consider the problem of fair allocation of indivisible items to agents that have arbitrary entitlements to the items. Every agent $i$ has a valuation function $v_i$ and an entitlement $b_i$, where entitlements sum up to~1. Which…

Computer Science and Game Theory · Computer Science 2024-05-24 Moshe Babaioff , Uriel Feige

We study auctions whose bidders are embedded in a social or economic network. As a result, even bidders who do not win the auction themselves might derive utility from the auction, namely, when a friend wins. On the other hand, when an…

Computer Science and Game Theory · Computer Science 2012-04-12 Po-An Chen , David Kempe

We consider a combinatorial auction setting where buyers have fractionally subadditive (XOS) valuations over the items and the seller's objective is to maximize the social welfare. A prophet inequality in this setting bounds the competitive…

Computer Science and Game Theory · Computer Science 2025-05-23 Shuchi Chawla , Trung Dang , Zhiyi Huang , Yifan Wang

This paper studies cooperative data-sharing between competitors vying to predict a consumer's tastes. We design optimal data-sharing schemes both for when they compete only with each other, and for when they additionally compete with an…

Computer Science and Game Theory · Computer Science 2021-11-24 Ronen Gradwohl , Moshe Tennenholtz

A retailer is purchasing goods in bundles from suppliers and then selling these goods in bundles to customers; her goal is to maximize profit, which is the revenue obtained from selling goods minus the cost of purchasing those goods. In…

Data Structures and Algorithms · Computer Science 2025-08-01 Yossi Azar , Niv Buchbinder , Roie Levin , Or Vardi

Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. However, expressing one's preferences can require bidding on all…

Computer Science and Game Theory · Computer Science 2007-05-23 Benoit Hudson , Tuomas Sandholm

We provide a library of participatory budgeting data (Pabulib) and open source tools (Pabutools and Pabustats) for analysing this data. We analyse how the results of participatory budgeting elections would change if a different selection…

Computer Science and Game Theory · Computer Science 2023-05-19 Piotr Faliszewski , Jarosław Flis , Dominik Peters , Grzegorz Pierczyński , Piotr Skowron , Dariusz Stolicki , Stanisław Szufa , Nimrod Talmon

We study equilibria of markets with $m$ heterogeneous indivisible goods and $n$ consumers with combinatorial preferences. It is well known that a competitive equilibrium is not guaranteed to exist when valuations are not gross substitutes.…

Computer Science and Game Theory · Computer Science 2014-06-04 Shahar Dobzinski , Michal Feldman , Inbal Talgam-Cohen , Omri Weinstein

We consider a fair division model in which agents have general valuations for bundles of indivisible items. We propose two new axiomatic properties for allocations in this model: EF1+- and EFX+-. We compare these with the existing EF1 and…

Computer Science and Game Theory · Computer Science 2020-06-24 Martin Aleksandrov

This paper considers utility indifference valuation of derivatives under model uncertainty and trading constraints, where the utility is formulated as an additive stochastic differential utility of both intertemporal consumption and…

Mathematical Finance · Quantitative Finance 2017-07-26 Huiwen Yan , Gechun Liang , Zhou Yang

This paper studies optimal bundling of products with non-additive values. Under monotonic preferences and single-peaked profits, I show a monopolist finds pure bundling optimal if and only if the optimal sales volume for the grand bundle is…

General Economics · Economics 2022-04-22 Soheil Ghili

In this paper, we revisit the common claim that double auctions necessarily generate competitive equilibria. We begin by observing that competitive equilibrium has some counterintuitive implications: specifically, it predicts that monotone…

Theoretical Economics · Economics 2022-09-19 Itzhak Rasooly

We study a new but simple model for online fair division in which indivisible items arrive one-by-one and agents have monotone utilities over bundles of the items. We consider axiomatic properties of mechanisms for this model such as…

Computer Science and Game Theory · Computer Science 2020-06-30 Martin Aleksandrov , Toby Walsh

There are several aspects of data markets that distinguish them from a typical commodity market: asymmetric information, the non-rivalrous nature of data, and informational externalities. Formally, this gives rise to a new class of games…

Computer Science and Game Theory · Computer Science 2023-03-29 Samir Wadhwa , Roy Dong

Experimental results on market behavior establish a lower stability and efficiency of markets for durable re-tradable assets compared to markets for non-durable, or perishable, goods. In this chapter, we revisit this known but…

General Finance · Quantitative Finance 2023-09-08 Sabiou Inoua , Vernon Smith

Competition and cooperation are inherent features of any multi-echelon supply chain. The interactions among the agents across the same echelon and that across various echelons influence the percolation of market demand across echelons. The…

Theoretical Economics · Economics 2024-01-11 Gurkirat Wadhwa , Tushar Shankar Walunj , Veeraruna Kavitha

We investigate the query complexity of the fair allocation of indivisible goods. For two agents with arbitrary monotonic utilities, we design an algorithm that computes an allocation satisfying envy-freeness up to one good (EF1), a…

Computer Science and Game Theory · Computer Science 2023-03-20 Hoon Oh , Ariel D. Procaccia , Warut Suksompong

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
‹ Prev 1 3 4 5 6 7 10 Next ›