中文
相关论文

相关论文: MUDA: A Truthful Multi-Unit Double-Auction Mechani…

200 篇论文

It is well-known that optimal (i.e., revenue-maximizing) selling mechanisms in multidimensional type spaces may involve randomization. We obtain conditions under which deterministic mechanisms are optimal for selling two identical,…

理论经济学 · 经济学 2022-02-22 Sushil Bikhchandani , Debasis Mishra

A central challenge in mechanism design is to develop truthful trade mechanisms that maximize the expected gains-from-trade (GFT) in two-sided markets with strategic agents. As achieving the full GFT is generally impossible, much of the…

计算机科学与博弈论 · 计算机科学 2026-04-02 Moshe Babaioff , Aviad Rubinstein , Xizhi Tan , Kangning Wang

We design simple mechanisms to approximate the Gains from Trade (GFT) in two-sided markets with multiple unit-supply sellers and multiple unit-demand buyers. A classical impossibility result by Myerson and Satterthwaite showed that even…

计算机科学与博弈论 · 计算机科学 2017-06-20 Johannes Brustle , Yang Cai , Fa Wu , Mingfei Zhao

This paper proposes a simple descriptive model of discrete-time double auction markets for divisible assets. As in the classical models of exchange economies, we consider a finite set of agents described by their initial endowments and…

理论经济学 · 经济学 2021-01-07 Teemu Pennanen

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.…

计算机科学与博弈论 · 计算机科学 2020-04-20 Yang Cai , Mingfei Zhao

We study the problem of a buyer (aka auctioneer) who gains stochastic rewards by procuring multiple units of a service or item from a pool of heterogeneous strategic agents. The reward obtained for a single unit from an allocated agent…

计算机科学与博弈论 · 计算机科学 2015-04-30 Satyanath Bhat , Shweta Jain , Sujit Gujar , Y. Narahari

We provide sufficient conditions for revenue maximization in a two-good monopoly where the buyer's values for the items come from independent (but not necessarily identical) distributions over bounded intervals. Under certain distributional…

计算机科学与博弈论 · 计算机科学 2015-11-24 Yiannis Giannakopoulos , Elias Koutsoupias

This research proposes a novel auction mechanism for transactive energy exchange between buyers and sellers, modeled as agents in a microgrid. The mechanism is implemented by a separate microgrid controller (MC) agent, and requires big data…

计算机科学与博弈论 · 计算机科学 2016-08-15 M. Nazif Faqiry , Sanjoy Das

Mechanism design, a branch of economics, aims to design rules that can autonomously achieve desired outcomes in resource allocation and public decision making. The research on mechanism design using machine learning is called automated…

计算机科学与博弈论 · 计算机科学 2024-12-17 Tsuyoshi Suehara , Koh Takeuchi , Hisashi Kashima , Satoshi Oyama , Yuko Sakurai , Makoto Yokoo

This paper designs a market algorithm for fractional ownership of an indivisible asset. It provides an efficient market mechanism, named Direct Fractional Auction (DFA) that offers valuable assets to both small and large investors who can…

综合经济学 · 经济学 2024-11-19 Dmitriy Taubman , Boris Gleyzer , Ke Yang , Farhad Rassekh

We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting. In such a setting there is a single…

计算机科学与博弈论 · 计算机科学 2018-11-14 Matthias Gerstgrasser , Paul W. Goldberg , Bart de Keijzer , Philip Lazos , Alexander Skopalik

This paper investigates the problem of proportionally fair double sided energy auction involving buying and selling agents. The grid is assumed to be operating under islanded mode. A distributed auction algorithm that can be implemented by…

计算机科学与博弈论 · 计算机科学 2016-05-24 M. Nazif Faqiry , Sanjoy Das

We study multi-unit auctions in which bidders have limited knowledge of opponent strategies and values. We characterize optimal prior-free bids; these bids minimize the maximal loss in expected utility resulting from uncertainty surrounding…

理论经济学 · 经济学 2023-05-02 Bernhard Kasberger , Kyle Woodward

In markets such as digital advertising auctions, bidders want to maximize value rather than payoff. This is different to the utility functions typically assumed in auction theory and leads to different strategies and outcomes. We refer to…

计算机科学与博弈论 · 计算机科学 2016-07-14 Salman Fadaei , Martin Bichler

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…

计算机科学与博弈论 · 计算机科学 2020-08-03 Moshe Babaioff , Nicole Immorlica , Brendan Lucier , S. Matthew Weinberg

We develop a general duality-theory framework for revenue maximization in additive Bayesian auctions. The framework extends linear programming duality and complementarity to constraints with partial derivatives. The dual system reveals the…

计算机科学与博弈论 · 计算机科学 2018-01-16 Yiannis Giannakopoulos , Elias Koutsoupias

We consider a periodic double auction (PDA) setting where buyers of the auction have multiple (but finite) opportunities to procure multiple but fixed units of a commodity. The goal of each buyer participating in such auctions is to reduce…

系统与控制 · 电气工程与系统科学 2023-10-05 Bharat Manvi , Easwar Subramanian

Double sided auctions are widely used in financial markets to match demand and supply. Prior works on double sided auctions have focused primarily on single quantity trade requests. We extend various notions of double sided auctions to…

计算机科学与博弈论 · 计算机科学 2021-04-20 Raja Natarajan , Suneel Sarswat , Abhishek Kr Singh

We introduce a formal framework for analyzing trades in financial markets. An exchange is where multiple buyers and sellers participate to trade. These days, all big exchanges use computer algorithms that implement double sided auctions to…

计算机科学中的逻辑 · 计算机科学 2019-07-19 Suneel Sarswat , Abhishek Kr Singh

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,…

计算机科学与博弈论 · 计算机科学 2015-03-09 Constantinos Daskalakis , Alan Deckelbaum , Christos Tzamos