中文
相关论文

相关论文: Optimal Deterministic Mechanisms for an Additive B…

200 篇论文

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…

计算机科学与博弈论 · 计算机科学 2016-07-14 Andrew Chi-Chih Yao

We study a robust selling problem where a seller attempts to sell one item to a buyer but is uncertain about the buyer's valuation distribution. Existing literature shows that robust screening provides a stronger theoretical guarantee than…

理论经济学 · 经济学 2024-09-27 Shixin Wang

We design novel mechanisms for welfare-maximization in two-sided markets. That is, there are buyers willing to purchase items and sellers holding items initially, both acting rationally and strategically in order to maximize utility. Our…

计算机科学与博弈论 · 计算机科学 2021-06-01 Alexander Braun , Thomas Kesselheim

We consider the revenue maximization problem of a monopolist via a non-Myersonian approach that could generalize to multiple items and multiple buyers. Although such an approach does not lead to any closed-form solution of the problem, it…

计算机科学与博弈论 · 计算机科学 2017-11-30 Song Zuo

We study a mechanism-design problem in which spiteful agents strive to not only maximize their rewards but also, contingent upon their own payoff levels, seek to lower the opponents' rewards. We characterize all individually rational (IR)…

计算机科学与博弈论 · 计算机科学 2025-12-02 Aditya Aradhye , David Lagziel , Eilon Solan

The auction of a single indivisible item is one of the most celebrated problems in mechanism design with transfers. Despite its simplicity, it provides arguably the cleanest and most insightful results in the literature. When the…

计算机科学与博弈论 · 计算机科学 2023-07-04 Rangeet Bhattacharyya , Parvik Dave , Palash Dey , Swaprava Nath

We study dynamic mechanisms for optimizing revenue in repeated auctions, that are robust to heterogeneous forward-looking and learning behavior of the buyers. Typically it is assumed that the buyers are either all myopic or are all infinite…

计算机科学与博弈论 · 计算机科学 2019-06-11 Shipra Agrawal , Eric Balkanski , Vahab Mirrokni , Balasubramanian Sivan

We are interested in the setting where a seller sells sequentially arriving items, one per period, via a dynamic auction. At the beginning of each period, each buyer draws a private valuation for the item to be sold in that period and this…

计算机科学与博弈论 · 计算机科学 2018-12-10 Vahab Mirrokni , Renato Paes Leme , Pingzhong Tang , Song Zuo

We show that computing the revenue-optimal deterministic auction in unit-demand single-buyer Bayesian settings, i.e. the optimal item-pricing, is computationally hard even in single-item settings where the buyer's value distribution is a…

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

We compare the expected efficiency of revenue maximizing (or {\em optimal}) mechanisms with that of efficiency maximizing ones. We show that the efficiency of the revenue maximizing mechanism for selling a single item with k + log_{e/(e-1)}…

计算机科学与博弈论 · 计算机科学 2009-06-08 Gagan Aggarwal , Gagan Goel , Aranyak Mehta

A recent line of research has established a novel desideratum for designing approximately-revenue-optimal multi-item mechanisms, namely the buy-many constraint. Under this constraint, prices for different allocations made by the mechanism…

计算机科学与博弈论 · 计算机科学 2024-05-17 Shuchi Chawla , Rojin Rezvan , Yifeng Teng , Christos Tzamos

The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good mechanisms for risk-averse sellers. As is standard in the…

计算机科学与博弈论 · 计算机科学 2010-04-02 Mukund Sundararajan , Qiqi Yan

Lately, the problem of designing multi-stage dynamic mechanisms has been shown to be both theoretically challenging and practically important. In this paper, we consider the problem of designing revenue optimal dynamic mechanism for a…

计算机科学与博弈论 · 计算机科学 2016-07-07 Vahab Mirrokni , Renato Paes Leme , Pingzhong Tang , Song Zuo

Diffusion auction design is a new trend in mechanism design for which the main goal is to incentivize existing buyers to invite new buyers, who are their neighbors on a social network, to join an auction even though they are competitors.…

计算机科学与博弈论 · 计算机科学 2024-08-26 Yao Zhang , Shanshan Zheng , Dengji Zhao

We introduce locality: a new property of multi-bidder auctions that formally separates the simplicity of optimal single-dimensional multi-bidder auctions from the complexity of optimal multi-dimensional multi-bidder auctions. Specifically,…

计算机科学与博弈论 · 计算机科学 2021-11-08 S. Matthew Weinberg , Zixin Zhou

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…

计算机科学与博弈论 · 计算机科学 2022-02-21 Dirk Bergemann , Yang Cai , Grigoris Velegkas , Mingfei Zhao

Consider a seller that intends to auction some item. The seller can invest money and effort in advertising in different market segments in order to recruit $n$ bidders to the auction. Alternatively, the seller can have a much cheaper and…

计算机科学与博弈论 · 计算机科学 2021-06-03 Amir Ban , Avi Cohen , Shahar Dobzinski , Itai Ashlagi

A rapidly growing literature on lying in behavioral economics and psychology shows that individuals often do not lie even when lying maximizes their utility. In this work, we attempt to incorporate these findings into the theory of…

计算机科学与博弈论 · 计算机科学 2021-11-23 Shahar Dobzinski , Sigal Oren

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

The role of a market maker is to simultaneously offer to buy and sell quantities of goods, often a financial asset such as a share, at specified prices. An automated market maker (AMM) is a mechanism that offers to trade according to some…

计算机科学与博弈论 · 计算机科学 2024-02-15 Michael J. Curry , Zhou Fan , David C. Parkes