English
Related papers

Related papers: Multi-unit Bilateral Trade

200 papers

We study the problem of selling $n$ items to a single buyer with an additive valuation function. We consider the valuation of the items to be correlated, i.e., desirabilities of the buyer for the items are not drawn independently. Ideally,…

Computer Science and Game Theory · Computer Science 2015-07-23 MohammadHossein Bateni , Sina Dehghani , MohammadTaghi Hajiaghayi , Saeed Seddighin

Double auctions are widely used in financial markets, such as those for stocks, derivatives, currencies, and commodities, to match demand and supply. Once all buyers and sellers have placed their trade requests, the exchange determines how…

Logic in Computer Science · Computer Science 2024-10-25 Mohit Garg , N. Raja , Suneel Sarswat , Abhishek Kr Singh

In most of microeconomic theory, consumers are assumed to exhibit decreasing marginal utilities. This paper considers combinatorial auctions among such submodular buyers. The valuations of such buyers are placed within a hierarchy of…

Computer Science and Game Theory · Computer Science 2007-05-23 Benny Lehmann , Daniel Lehmann , Noam Nisan

Classical Bayesian mechanism design relies on the common prior assumption, but such prior is often not available in practice. We study the design of prior-independent mechanisms that relax this assumption: the seller is selling an…

Theoretical Economics · Economics 2024-12-12 Jerry Anunrojwong , Santiago R. Balseiro , Omar Besbes

We study the problem of designing mechanisms for trading networks that satisfy four desired properties: dominant-strategy incentive compatibility, efficiency, weak budget balance (WBB), and individual rationality (IR). Although there exist…

Computer Science and Game Theory · Computer Science 2022-08-22 Takayuki Osogami , Segev Wasserkrug , Elisheva S. Shamash

A monopolistic seller aims to sell an indivisible item to multiple potential buyers. Each buyer's valuation depends on their private type and the item's quality. The seller can observe the quality but it is unknown to buyers. This quality…

Computer Science and Game Theory · Computer Science 2024-11-13 Zhikang Fan , Weiran Shen

Budget-feasible procurement has been a major paradigm in mechanism design since its introduction by Singer (2010). An auctioneer (buyer) with a strict budget constraint is interested in buying goods or services from a group of strategic…

Computer Science and Game Theory · Computer Science 2025-05-30 Georgios Amanatidis , Sophie Klumper , Evangelos Markakis , Guido Schäfer , Artem Tsikiridis

We present a novel bilateral negotiation model that allows a self-interested agent to learn how to negotiate over multiple issues in the presence of user preference uncertainty. The model relies upon interpretable strategy templates…

Multiagent Systems · Computer Science 2022-01-10 Pallavi Bagga , Nicola Paoletti , Kostas Stathis

We study fair resource allocation with strategic agents. It is well-known that, across multiple fundamental problems in this domain, truthfulness and fairness are incompatible. For example, when allocating indivisible goods, no truthful and…

Computer Science and Game Theory · Computer Science 2024-05-20 Vasilis Gkatzelis , Alexandros Psomas , Xizhi Tan , Paritosh Verma

Multi-task learning aims to acquire a set of functions, either regressors or classifiers, that perform well for diverse tasks. At its core, the idea behind multi-task learning is to exploit the intrinsic similarity across data sources to…

Machine Learning · Computer Science 2022-10-28 Juan Cervino , Juan Andres Bazerque , Miguel Calvo-Fullana , Alejandro Ribeiro

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

Very few exact solutions are known for the monopolist's $k$-item $n$-buyer maximum revenue problem with additive valuation in which $k, n >1$ and the buyers $i$ have independent private distributions $F^j_i$ on items $j$. In this paper we…

Computer Science and Game Theory · Computer Science 2016-07-14 Andrew Chi-Chih Yao

The study of repeated interactions between a learner and a utility-maximizing optimizer has yielded deep insights into the manipulability of learning algorithms. However, existing literature primarily focuses on independent, unlinked…

Computer Science and Game Theory · Computer Science 2026-04-10 Giannis Fikioris , Balasubramanian Sivan , Éva Tardos

The problem of designing a profit-maximizing, Bayesian incentive compatible and individually rational mechanism with flexible consumers and costly heterogeneous supply is considered. In our setup, each consumer is associated with a…

Computer Science and Game Theory · Computer Science 2018-02-01 Shiva Navabi , Ashutosh Nayyar

A single unit of a good is sold to one of two bidders. Each bidder has either a high prior valuation or a low prior valuation for the good. Their prior valuations are independently and identically distributed. Each bidder may observe an…

Theoretical Economics · Economics 2022-05-10 Wanchang Zhang

We study revenue maximization through sequential posted-price (SPP) mechanisms in single-dimensional settings with $n$ buyers and independent but not necessarily identical value distributions. We construct the SPP mechanisms by considering…

Computer Science and Game Theory · Computer Science 2021-01-11 Hedyeh Beyhaghi , Negin Golrezaei , Renato Paes Leme , Martin Pal , Balasubramanian Sivan

We consider the problem of designing an expected-revenue maximizing mechanism for allocating multiple non-perishable goods of $k$ varieties to flexible consumers over $T$ time steps. In our model, a random number of goods of each variety…

Computer Science and Game Theory · Computer Science 2020-07-08 Shiva Navabi , Ashutosh Nayyar

I consider an environment in which a decision maker faces uncertainty and privately holds information in the form of a signal about the true state of the world. The decision maker purchases additional information from a data broker before…

Theoretical Economics · Economics 2026-03-02 Arlindo Skënderaj

We consider repeated multi-unit auctions with uniform pricing, which are widely used in practice for allocating goods such as carbon licenses. In each round, $K$ identical units of a good are sold to a group of buyers that have valuations…

Computer Science and Game Theory · Computer Science 2024-01-17 Simina Brânzei , Mahsa Derakhshan , Negin Golrezaei , Yanjun Han

We consider reallocation problems in settings where the initial endowment of each agent consists of a subset of the resources. The private information of the players is their value for every possible subset of the resources. The goal is to…

Computer Science and Game Theory · Computer Science 2014-04-29 Liad Blumrosen , Shahar Dobzinski