English
Related papers

Related papers: (Almost) Efficient Mechanisms for Bilateral Tradin…

200 papers

An indivisible object may be sold to one of $n$ agents who know their valuations of the object. The seller would like to use a revenue-maximizing mechanism but her knowledge of the valuations' distribution is scarce: she knows only the…

Theoretical Economics · Economics 2020-08-27 Alex Suzdaltsev

Auctions are widely used in exchanges to match buy and sell requests. Once the buyers and sellers place their requests, the exchange determines how these requests are to be matched. The two most popular objectives used while determining the…

Data Structures and Algorithms · Computer Science 2024-03-06 Mohit Garg , Suneel Sarswat

We model a procurement scenario in which two \textit{imperfect} bidders act simultaneously on behalf of a single buyer, a configuration common in display advertising and referred to as \textit{side-by-side bidding} but largely unexplored in…

Computer Science and Game Theory · Computer Science 2025-12-05 Benjamin Heymann

In economics, there are many ways to describe the interaction between a "seller" and a "buyer". The most common one, with which we interact almost every day, is selling for a fixed price. This option is perfect for selling a mass product,…

General Finance · Quantitative Finance 2024-07-10 O. A. Malafeyev , I. E. Khomenko

We analyze a model of selling a single object to a principal-agent pair who want to acquire the object for a firm. The principal and the agent have different assessments of the object's value to the firm. The agent is budget-constrained…

Theoretical Economics · Economics 2024-10-07 Debasis Mishra , Kolagani Paramahamsa

We propose a pseudo-market solution to resource allocation problems subject to constraints. Our treatment of constraints is general: including bihierarchical constraints due to considerations of diversity in school choice, or scheduling in…

Theoretical Economics · Economics 2020-11-09 Federico Echenique , Antonio Miralles , Jun Zhang

We consider a revenue-maximizing seller with $n$ items facing a single buyer. We introduce the notion of symmetric menu complexity of a mechanism, which counts the number of distinct options the buyer may purchase, up to permutations of the…

Computer Science and Game Theory · Computer Science 2020-05-08 Pravesh Kothari , Divyarthi Mohan , Ariel Schvartzman , Sahil Singla , S. Matthew Weinberg

We consider the problem of a revenue-maximizing seller with m items for sale to n additive bidders with hard budget constraints, assuming that the seller has some prior distribution over bidder values and budgets. The prior may be…

Computer Science and Game Theory · Computer Science 2016-05-09 Constantinos Daskalakis , Nikhil R. Devanur , S. Matthew Weinberg

We study sequential bilateral trade where sellers and buyers valuations are completely arbitrary (i.e., determined by an adversary). Sellers and buyers are strategic agents with private valuations for the good and the goal is to design a…

Computer Science and Game Theory · Computer Science 2024-10-11 Yossi Azar , Amos Fiat , Federico Fusco

We propose a simple market model where agents trade different types of products with each other by using money, relying only on local information. Value fluctuations of single products, combined with the condition of maximum profit in…

Condensed Matter · Physics 2015-06-24 Raul Donangelo , Alex Hansen , Kim Sneppen , Sergio R. Souza

Motivated by the emergence of popular service-based two-sided markets where sellers can serve multiple buyers at the same time, we formulate and study the {\em two-sided cost sharing} problem. In two-sided cost sharing, sellers incur…

Computer Science and Game Theory · Computer Science 2021-07-14 Sreenivas Gollapudi , Kostas Kollias , Ali Shameli

With recent development of artificial intelligence, it is more common to adopt AI agents in economic activities. This paper explores the economic actions of agents, including human agents and AI agents, in an economic game of trading…

Theoretical Economics · Economics 2026-03-03 Huan Cai , Ziqing Lu , Catherine Xu , Weiyu Xu , Jie Zheng

Pair trading is one of the most effective statistical arbitrage strategies which seeks a neutral profit by hedging a pair of selected assets. Existing methods generally decompose the task into two separate steps: pair selection and trading.…

Computational Finance · Quantitative Finance 2023-09-26 Weiguang Han , Boyi Zhang , Qianqian Xie , Min Peng , Yanzhao Lai , Jimin Huang

We address auctions in two-sided markets with budget constraints on buyers, a fundamental setting also crucial for applications such as display advertising. Our goal is to design efficient mechanisms that satisfy dominant strategy incentive…

Computer Science and Game Theory · Computer Science 2024-11-05 Ryosuke Sato

We consider the online problem in which an intermediary trades identical items with a sequence of n buyers and n sellers, each of unit demand. We assume that the values of the traders are selected by an adversary and the sequence is…

Computer Science and Game Theory · Computer Science 2020-07-17 Elias Koutsoupias , Philip Lazos

We study the problem of selling information to a data-buyer who faces a decision problem under uncertainty. We consider the classic Bayesian decision-theoretic model pioneered by [Blackwell, 1951, 1953]. Initially, the data buyer has only…

Computer Science and Game Theory · Computer Science 2022-02-21 Dirk Bergemann , Yang Cai , Grigoris Velegkas , Mingfei Zhao

Motivated by the problem of market power in electricity markets, we introduced in previous works a mechanism for simplified markets of two agents with linear cost. In standard procurement auctions, the market power resulting from the…

Theoretical Economics · Economics 2019-07-25 Benjamin Heymann , Alejandro Jofré

Motivated by applications such as stock exchanges and spectrum auctions, there is a growing interest in mechanisms for arranging trade in two-sided markets. Existing mechanisms are either not truthful, or do not guarantee an…

Computer Science and Game Theory · Computer Science 2018-05-02 Erel Segal-Halevi , Avinatan Hassidim , Yonatan Aumann

We investigate a market without money in which agents can offer certain goods (or multiple copies of an agent-specific good) in exchange for goods of other agents. The exchange must be balanced in the sense that each agent should receive a…

Discrete Mathematics · Computer Science 2021-04-02 Pavlos Eirinakis , Ioannis Mourtos , Michalis Samaris

How does one allocate a collection of resources to a set of strategic agents in a fair and efficient manner without using money? For in many scenarios it is not feasible to use money to compensate agents for otherwise unsatisfactory…

Computer Science and Game Theory · Computer Science 2012-07-10 Richard Cole , Vasilis Gkatzelis , Gagan Goel
‹ Prev 1 3 4 5 6 7 10 Next ›