中文
相关论文

相关论文: Profitable Bayesian implementation in one-shot mec…

200 篇论文

This paper develops the theory of mechanism redesign by which an auctioneer can reoptimize an auction based on bid data collected from previous iterations of the auction on bidders from the same market. We give a direct method for…

计算机科学与博弈论 · 计算机科学 2022-02-15 Shuchi Chawla , Jason D. Hartline , Denis Nekipelov , Anant Shah

This paper studies dynamic mechanism design in a quasilinear Markovian environment and analyzes a direct mechanism model of a principal-agent framework in which the agent is allowed to exit at any period. We consider that the agent's…

动力系统 · 数学 2021-05-10 Tao Zhang , Quanyan Zhu

We study a dynamic model of Bayesian persuasion in sequential decision-making settings. An informed principal observes an external parameter of the world and advises an uninformed agent about actions to take over time. The agent takes…

计算机科学与博弈论 · 计算机科学 2022-05-25 Jiarui Gan , Rupak Majumdar , Goran Radanovic , Adish Singla

Mechanism design is now a standard tool in computer science for aligning the incentives of self-interested agents with the objectives of a system designer. There is, however, a fundamental disconnect between the traditional application…

计算机科学与博弈论 · 计算机科学 2008-04-15 Jason D. Hartline , Tim Roughgarden

In revenue maximization of selling a digital product in a social network, the utility of an agent is often considered to have two parts: a private valuation, and linearly additive influences from other agents. We study the incomplete…

计算机科学与博弈论 · 计算机科学 2011-09-27 Wei Chen , Pinyan Lu , Xiaorui Sun , Bo Tang , Yajun Wang , Zeyuan Allen Zhu

We explore the possibility of designing matching mechanisms that can accommodate non-standard choice behavior. We pin down the necessary and sufficient conditions on participants' choice behavior for the existence of stable and incentive…

理论经济学 · 经济学 2024-08-12 Gian Caspari , Manshu Khanna

Imitation is widely observed in populations of decision-making agents. Using our recent convergence results for asynchronous imitation dynamics on networks, we consider how such networks can be efficiently driven to a desired equilibrium…

计算机科学与博弈论 · 计算机科学 2017-04-17 James Riehl , Pouria Ramazi , Ming Cao

How to optimally persuade an agent who has a private type? When elicitation is feasible, this amounts to a fairly standard principal-agent-style mechanism design problem, where the persuader employs a mechanism to first elicit the agent's…

计算机科学与博弈论 · 计算机科学 2024-11-01 Jiarui Gan , Abheek Ghosh , Nicholas Teh

We introduce a model of probabilistic verification in mechanism design. The principal elicits a message from the agent and then selects a test to give the agent. The agent's true type determines the probability with which he can pass each…

理论经济学 · 经济学 2025-01-16 Ian Ball , Deniz Kattwinkel

We consider a mechanism design setting with a single item and a single buyer who is uncertain about the value of the item. Both the buyer and the seller have a common model for the buyer's value, but the buyer discovers her true value only…

计算机科学与博弈论 · 计算机科学 2025-07-08 Saeed Alaei , Shuchi Chawla , Zhiyi Huang , Ali Makhdoumi , Azarakhsh Malekian

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 revisit the well-studied problem of budget-feasible procurement, where a buyer with a strict budget constraint seeks to acquire services from a group of strategic providers (the sellers). During the last decade, several strategyproof…

计算机科学与博弈论 · 计算机科学 2021-07-22 Eric Balkanski , Pranav Garimidi , Vasilis Gkatzelis , Daniel Schoepflin , Xizhi Tan

We study the design of mechanisms -- e.g., auctions -- when the designer does not control information flows between mechanism participants. A mechanism equilibrium is leakage-proof if no player conditions their actions on leaked…

理论经济学 · 经济学 2025-11-04 Samuel Häfner , Marek Pycia , Haoyuan Zeng

Consider a trade market with one seller and multiple buyers. The seller aims to sell an indivisible item and maximize their revenue. This paper focuses on a simple and popular mechanism--the fixed-price mechanism. Unlike the standard…

计算机科学与博弈论 · 计算机科学 2024-11-19 Zhikang Fan , Weiran Shen

We investigate mechanism design without payments when agents have different types of preferences. Contrary to most settings in the literature where agents have the same preference, e.g. in the facility location games all agents would like…

计算机科学与博弈论 · 计算机科学 2016-09-16 Qiang Zhang

We derive the revenue-optimal efficient (welfare-maximizing) mechanism in a general multidimensional mechanism design setting when type spaces -- that is, the underlying domains from which agents' values come from -- can capture arbitrarily…

计算机科学与博弈论 · 计算机科学 2025-05-21 Siddharth Prasad , Maria-Florina Balcan , Tuomas Sandholm

We study how a decision-maker can acquire more information from an agent by reducing her own ability to observe what the agent transmits. In a large class of binary-action games, opacity design is just as good as full commitment to actions…

理论经济学 · 经济学 2024-02-07 Mark Whitmeyer

We consider a fixed-price mechanism design setting where a seller sells one item via a social network, but the seller can only directly communicate with her neighbours initially. Each other node in the network is a potential buyer with a…

计算机科学与博弈论 · 计算机科学 2019-05-15 Tianyi Zhang , Dengji Zhao , Wen Zhang , Xuming He

We study principal-agent problems in which a principal commits to an outcome-dependent payment scheme (a.k.a. contract) so as to induce an agent to take a costly, unobservable action. We relax the assumption that the principal perfectly…

计算机科学与博弈论 · 计算机科学 2021-06-02 Matteo Castiglioni , Alberto Marchesi , Nicola Gatti

The Bayesian persuasion paradigm of strategic communication models interaction between a privately-informed agent, called the sender, and an ignorant but rational agent, called the receiver. The goal is typically to design a (near-)optimal…

计算机科学与博弈论 · 计算机科学 2021-06-21 Ronen Gradwohl , Niklas Hahn , Martin Hoefer , Rann Smorodinsky