English
Related papers

Related papers: Non-Excludable Bilateral Trade Between Groups

200 papers

When agents with independent priors bid for a single item, Myerson's optimal auction maximizes expected revenue, whereas Vickrey's second-price auction optimizes social welfare. We address the natural question of trade-offs between the two…

Computer Science and Game Theory · Computer Science 2012-05-15 Ilias Diakonikolas , Christos Papadimitriou , George Pierrakos , Yaron Singer

Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…

Logic in Computer Science · Computer Science 2026-05-05 Victor Barroso-Nascimento , Maria Osório , Elaine Pimentel

This paper develops a theory of competitive equilibrium with indivisible goods based entirely on economic conditions on demand. The key idea is to analyze complementarity and substitutability between bundles of goods, rather than merely…

Theoretical Economics · Economics 2024-12-12 Ravi Jagadeesan , Alexander Teytelboym

In a seminal paper, McAfee (1992) presented a truthful mechanism for double auctions, attaining asymptotically-optimal gain-from-trade without any prior information on the valuations of the traders. McAfee's mechanism handles…

Computer Science and Game Theory · Computer Science 2017-12-20 Erel Segal-Halevi , Avinatan Hassidim , Yonatan Aumann

We consider a setting where $n$ buyers, with combinatorial preferences over $m$ items, and a seller, running a priority-based allocation mechanism, repeatedly interact. Our goal, from observing limited information about the results of these…

Computer Science and Game Theory · Computer Science 2014-08-29 Avrim Blum , Yishay Mansour , Jamie Morgenstern

Optimal mechanisms have been provided in quite general multi-item settings, as long as each bidder's type distribution is given explicitly by listing every type in the support along with its associated probability. In the implicit setting,…

Computer Science and Game Theory · Computer Science 2015-03-09 Constantinos Daskalakis , Alan Deckelbaum , Christos Tzamos

In barter exchanges agents enter seeking to swap their items for other items on their wishlist. We consider a centralized barter exchange with a set of agents and items where each item has a positive value. The goal is to compute a…

Data Structures and Algorithms · Computer Science 2024-06-21 Juan Luque , Sharmila Duppala , John Dickerson , Aravind Srinivasan

We consider a monopolist seller with $n$ heterogeneous items, facing a single buyer. The buyer has a value for each item drawn independently according to (non-identical) distributions, and her value for a set of items is additive. The…

Computer Science and Game Theory · Computer Science 2020-08-03 Moshe Babaioff , Nicole Immorlica , Brendan Lucier , S. Matthew Weinberg

A monopolist offers personalized prices to consumers with unit demand, heterogeneous values, and idiosyncratic costs, who differ in a protected characteristic, such as race or gender. The seller is subject to a non-discrimination…

Theoretical Economics · Economics 2025-06-27 Philipp Strack , Kai Hao Yang

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

With the rapid development of distributed energy resources, increasing number of residential and commercial users have been switched from pure electricity consumers to prosumers that can both consume and produce energy. To properly manage…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-09-15 Bing Liu , Furan Xie , Li Chai

A competitive market is modeled as a game of incomplete information. One player observes some payoff-relevant state and can sell (possibly noisy) messages thereof to the other, whose willingness to pay is contingent on their own beliefs. We…

Computer Science and Game Theory · Computer Science 2025-05-02 Thomas Falconer , Anubhav Ratha , Jalal Kazempour , Pierre Pinson , Maryam Kamgarpour

A fundamental result in mechanism design theory, the so-called revelation principle, asserts that for many questions concerning the existence of mechanisms with a given outcome one can restrict attention to truthful direct…

Computer Science and Game Theory · Computer Science 2011-02-18 Paul Dütting , Felix Fischer , David C. Parkes

Consider the problem of allocating goods to buyers through an auction. An auction is efficient if the resulting allocation maximizes total welfare, conditional on the information available. If buyers have private values, the…

Computer Science and Game Theory · Computer Science 2018-05-23 Andrei Ciupan

We study mechanism design when agents may have hidden secondary goals which will manifest as non-trivial preferences among outcomes for which their primary utility is the same. We show that in such cases, a mechanism is robust against…

Computer Science and Game Theory · Computer Science 2023-07-25 Renato Paes Leme , Jon Schneider , Hanrui Zhang

Myerson's seminal characterization of the revenue-optimal auction for a single item \cite{myerson1981optimal} remains a cornerstone of mechanism design. However, generalizing this framework to multi-item settings has proven exceptionally…

Computer Science and Game Theory · Computer Science 2025-10-08 Marios Mertzanidis , Athina Terzoglou

Over the past few years, the futures market has been successfully developing in the North-West region. Futures markets are one of the most effective and liquid-visible trading mechanisms. A large number of buyers are forced to compete with…

Mathematical Finance · Quantitative Finance 2018-08-16 Oleg Malafeyev , Shulga Andrey

We study the problem of mechanism design for allocating a set of indivisible items among agents with private preferences on items. We are interested in such a mechanism that is strategyproof (where agents' best strategy is to report their…

Computer Science and Game Theory · Computer Science 2024-08-05 Ankang Sun , Bo Chen

We study a classical Bayesian mechanism design problem where a seller is selling multiple items to multiple buyers. We consider the case where the seller has costs to produce the items, and these costs are private information to the seller.…

Computer Science and Game Theory · Computer Science 2020-04-20 Yang Cai , Mingfei Zhao

We consider two sided matching markets consisting of agents with non-transferable utilities; agents from the opposite sides form matching pairs (e.g., buyers-sellers) and negotiate the terms of their math which may include a monetary…

Computer Science and Game Theory · Computer Science 2012-12-05 Saeed Alaei , Kamal Jain , Azarakhsh Malekian