English
Related papers

Related papers: Interdependent Bilateral Trade: Information vs App…

200 papers

We study the problem of social welfare maximization in bilateral trade, where two agents, a buyer and a seller, trade an indivisible item. We consider arguably the simplest form of mechanisms -- the fixed-price mechanisms, where the…

Computer Science and Game Theory · Computer Science 2023-06-21 Yang Cai , Jinzhao Wu

We study the welfare effects of overreaction to information in the form of diagnostic expectations in markets with asymmetric information, and the effect of a simple intervention in the form of a tax or a subsidy. A large enough level of…

Theoretical Economics · Economics 2024-03-14 Matteo Bizzarri , Daniele d'Arienzo

We consider the bilateral trade problem, in which two agents trade a single indivisible item. It is known that the only dominant-strategy truthful mechanism is the fixed-price mechanism: given commonly known distributions of the buyer's…

Computer Science and Game Theory · Computer Science 2021-12-21 Zi Yang Kang , Francisco Pernice , Jan Vondrák

We examine information structure design, also called "persuasion" or "signaling", in the presence of a constraint on the amount of communication. We focus on the fundamental setting of bilateral trade, which in its simplest form involves a…

Computer Science and Game Theory · Computer Science 2020-03-09 Shaddin Dughmi , David Kempe , Ruixin Qiang

We study the bilateral trade problem where a seller owns a single indivisible item, and a potential buyer seeks to purchase it. Previous mechanisms for this problem only considered the case where the values of the buyer and the seller are…

Computer Science and Game Theory · Computer Science 2024-04-17 Shahar Dobzinski , Ariel Shaulker

We study bilateral trade with interdependent values as an informed-principal problem. The mechanism-selection game has multiple equilibria that differ with respect to principal's payoff and trading surplus. We characterize the equilibrium…

Theoretical Economics · Economics 2022-02-22 Takeshi Nishimura

In a multi-party machine learning system, different parties cooperate on optimizing towards better models by sharing data in a privacy-preserving way. A major challenge in learning is the incentive issue. For example, if there is…

Multiagent Systems · Computer Science 2020-08-11 Mengjing Chen , Yang Liu , Weiran Shen , Yiheng Shen , Pingzhong Tang , Qiang Yang

This paper explores the gain maximization problem of two nations engaging in non-cooperative bilateral trade. Probabilistic model of an exchange of commodities under different price systems is considered. Volume of commodities exchanged…

Theoretical Economics · Economics 2020-01-09 Tsotne Kutalia , Revaz Tevzadze

We study the problem of designing a two-sided market (double auction) to maximize the gains from trade (social welfare) under the constraints of (dominant-strategy) incentive compatibility and budget-balance. Our goal is to do so for an…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Amitai Frey , Noam Nisan

From social networks to supply chains, more and more aspects of how humans, firms and organizations interact is mediated by artificial learning agents. As the influence of machine learning systems grows, it is paramount that we study how to…

Multiagent Systems · Computer Science 2022-11-02 Andrea Tacchetti , DJ Strouse , Marta Garnelo , Thore Graepel , Yoram Bachrach

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

Research on promoting cooperation among autonomous, self-regarding agents has often focused on the bi-objective optimisation problem: minimising the total incentive cost while maximising the frequency of cooperation. However, the optimal…

We study the power of item-pricing as a tool for approximately optimizing social welfare in a combinatorial market. We consider markets with $m$ indivisible items and $n$ buyers. The goal is to set prices to the items so that, when agents…

Computer Science and Game Theory · Computer Science 2015-11-10 Michal Feldman , Nick Gravin , Brendan Lucier

Data buyers compete in a game of incomplete information about which a single data seller owns some payoff-relevant information. The seller faces a joint information- and mechanism-design problem: deciding which information to sell, while…

Computer Science and Game Theory · Computer Science 2024-11-18 Alessandro Bonatti , Munther Dahleh , Thibaut Horel , Amir Nouripour

We study truthful mechanisms for welfare maximization in online bipartite matching. In our (multi-parameter) setting, every buyer is associated with a (possibly private) desired set of items, and has a private value for being assigned an…

Computer Science and Game Theory · Computer Science 2024-02-20 Michal Feldman , Federico Fusco , Stefano Leonardi , Simon Mauras , Rebecca Reiffenhäuser

Large-scale online recommendation systems must facilitate the allocation of a limited number of items among competing users while learning their preferences from user feedback. As a principled way of incorporating market constraints and…

Machine Learning · Computer Science 2022-12-15 Yigit Efe Erginbas , Soham Phade , Kannan Ramchandran

Bilateral trade is one of the most natural and important forms of economic interaction: A seller has a single, indivisible item for sale, and a buyer is potentially interested. The two parties typically have different, privately known…

Computer Science and Game Theory · Computer Science 2023-12-20 Yixuan Even Xu , Hanrui Zhang , Vincent Conitzer

We study the interplay of fairness, welfare, and equity considerations in personalized pricing based on customer features. Sellers are increasingly able to conduct price personalization based on predictive modeling of demand conditional on…

Machine Learning · Computer Science 2020-12-29 Nathan Kallus , Angela Zhou

Classic results show that even an arbitrarily small correlation across bidders' information can enable full surplus extraction in auctions and related mechanism design settings. Motivated by this fragility, we study the information…

Computer Science and Game Theory · Computer Science 2026-04-28 Boyu Liu , Wei Tang , Zihe Wang , Shuo Zhang

In this paper we study the implementation challenge in an abstract interdependent values model and an arbitrary objective function. We design a mechanism that allows for approximate optimal implementation of insensitive objective functions…

Computer Science and Game Theory · Computer Science 2015-03-14 Kobbi Nissim , Rann Smorodinsky , Moshe Tennenholtz
‹ Prev 1 2 3 10 Next ›