中文
相关论文

相关论文: Truth Revelation in Approximately Efficient Combin…

200 篇论文

In digital goods auctions, there is an auctioneer who sells an item with unlimited supply to a set of potential buyers, and the objective is to design truthful auction to maximize the total profit of the auctioneer. Motivated from an…

计算机科学与博弈论 · 计算机科学 2011-07-27 Nick Gravin , Pinyan Lu

Cloud service providers typically provide different types of virtual machines (VMs) to cloud users with various requirements. Thanks to its effectiveness and fairness, auction has been widely applied in this heterogeneous resource…

密码学与安全 · 计算机科学 2020-01-06 Tianjiao Ni , Zhili Chen , Lin Chen , Hong Zhong , Shun Zhang , Yan Xu

I study the optimal pricing process for selling a unit good to a buyer with prospect theory preferences. In the presence of probability weighting, the buyer is dynamically inconsistent and can be either sophisticated or naive about her own…

理论经济学 · 经济学 2023-08-29 Tan Gan

We study the inefficiency of mixed equilibria, expressed as the price of anarchy, of all-pay auctions in three different environments: combinatorial, multi-unit and single-item auctions. First, we consider item-bidding combinatorial…

计算机科学与博弈论 · 计算机科学 2015-08-06 George Christodoulou , Alkmini Sgouritsa , Bo Tang

We study the problem of learning revenue-optimal multi-bidder auctions from samples when the samples of bidders' valuations can be adversarially corrupted or drawn from distributions that are adversarially perturbed. First, we prove tight…

计算机科学与博弈论 · 计算机科学 2021-07-14 Wenshuo Guo , Michael I. Jordan , Manolis Zampetakis

We present an incentive-compatible polynomial-time approximation scheme for multi-unit auctions with general k-minded player valuations. The mechanism fully optimizes over an appropriately chosen sub-range of possible allocations and then…

计算机科学与博弈论 · 计算机科学 2014-01-17 Shahar Dobzinski , Noam Nisan

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 examine trade-offs among stakeholders in ad auctions. Our metrics are the revenue for the utility of the auctioneer, the number of clicks for the utility of the users and the welfare for the utility of the advertisers. We show how to…

计算机科学与博弈论 · 计算机科学 2014-04-22 Yoram Bachrach , Sofia Ceppi , Ian A. Kash , Peter Key , David Kurokawa

Recent literature highlights the advantages of implementing social rules via dynamic game forms. We characterize when truth-telling remains a dominant strategy in gradual mechanisms implementing strategy-proof social rules, where agents…

理论经济学 · 经济学 2025-03-27 Wenqian Wang , Zhiwen Zheng

Most of the economic reports forecast that almost half of the worldwide market value unlocked by AI over the next decade (up to 6 trillion USD per year) will be in marketing&sales. In particular, AI will enable the optimization of more and…

计算机科学与博弈论 · 计算机科学 2022-01-31 Matteo Castiglioni , Diodato Ferraioli , Nicola Gatti , Alberto Marchesi , Giulia Romano

I study the design of auctions in which the auctioneer is assumed to have information only about the marginal distribution of a generic bidder's valuation, but does not know the correlation structure of the joint distribution of bidders'…

理论经济学 · 经济学 2022-05-10 Wanchang Zhang

With the increasing use of auctions in online advertising, there has been a large effort to study seller revenue maximization, following Myerson's seminal work, both theoretically and practically. We take the point of view of the buyer in…

计算机科学与博弈论 · 计算机科学 2019-03-27 Marc Abeille , Clément Calauzènes , Noureddine El Karoui , Thomas Nedelec , Vianney Perchet

Game theory has been developed by scientists as a theory of strategic interaction among players who are supposed to be perfectly rational. These strategic interactions might have been presented in an auction, a business negotiation, a chess…

计算机科学与博弈论 · 计算机科学 2020-04-07 Medet Kanmaz , Elif Surer

We consider the problem of designing a revenue-maximizing auction for a single item, when the values of the bidders are drawn from a correlated distribution. We observe that there exists an algorithm that finds the optimal randomized…

计算机科学与博弈论 · 计算机科学 2015-03-17 Shahar Dobzinski , Hu Fu , Robert Kleinberg

We introduce a new class of combinatorial markets in which agents have covering constraints over resources required and are interested in delay minimization. Our market model is applicable to several settings including scheduling, cloud…

计算机科学与博弈论 · 计算机科学 2017-04-17 Nikhil Devanur , Jugal Garg , Ruta Mehta , Vijay V. Vazirani , Sadra Yazdanbod

Online double auctions (DAs) model a dynamic two-sided matching problem with private information and self-interest, and are relevant for dynamic resource and task allocation problems. We present a general method to design truthful DAs, such…

计算机科学与博弈论 · 计算机科学 2012-07-09 Jonathan Bredin , David C. Parkes

Redistribution mechanism design aims to redistribute the revenue collected by a truthful auction back to its participants without affecting the truthfulness. We study redistribution mechanisms for diffusion auctions, which is a new trend in…

计算机科学与博弈论 · 计算机科学 2023-03-07 Sizhe Gu , Yao Zhang , Yida Zhao , Dengji Zhao

Quantum game theory, whatever opinions may be held due to its abstract physical formalism, have already found various applications even outside the orthodox physics domain. In this paper we introduce the concept of a quantum auction, its…

综合金融 · 定量金融 2009-11-13 E. W. Piotrowski , J. Sladkowski

Market-based mechanisms such as auctions are being studied as an appropriate means for resource allocation in distributed and mulitagent decision problems. When agents value resources in combination rather than in isolation, they must often…

人工智能 · 计算机科学 2013-01-30 Craig Boutilier , Moises Goldszmidt , Bikash Sabata

We consider truthful combinatorial auctions with items $M = [m]$ for sale to $n$ bidders, where each bidder $i$ has a private monotone valuation $v_i : 2^M \to R_+$. Among truthful mechanisms, maximal-in-range (MIR) mechanisms achieve the…

计算机科学与博弈论 · 计算机科学 2024-04-02 Frederick V. Qiu , S. Matthew Weinberg