中文
相关论文

相关论文: Optimal Auctions vs. Anonymous Pricing: Beyond Lin…

200 篇论文

Auction is the common paradigm for resource allocation which is a fundamental problem in human society. Existing research indicates that the two primary objectives, the seller's revenue and the allocation efficiency, are generally…

计算机科学与博弈论 · 计算机科学 2019-05-27 Bin Li , Dong Hao , Dengji Zhao , Makoto Yokoo

We study efficiency loss in Bayesian revenue optimal auctions. We quantify this as the worst case ratio of loss in the realized social welfare to the social welfare that can be realized by an efficient auction. Our focus is on auctions with…

计算机科学与博弈论 · 计算机科学 2010-09-14 Vineet Abhishek , Bruce Hajek

Reserve prices are widely used in practice. The problem of designing revenue-optimal auctions based on reserve price has drawn much attention in the auction design community. Although they have been extensively studied, most developments…

理论经济学 · 经济学 2025-07-22 Yifan Huang , Dong Hao , Zhiyi Fan , Yuhang Guo , Bin Li

With the growth of networks, promoting products through social networks has become an important problem. For auctions in social networks, items are needed to be sold to agents in a network, where each agent can bid and also diffuse the sale…

计算机科学与博弈论 · 计算机科学 2023-08-03 Mingyu Xiao , Guixin Lin , Bakh Khoussainov , Yuchao Song

We consider a class of generalized capital asset pricing models in continuous time with a finite number of agents and tradable securities. The securities may not be sufficient to span all sources of uncertainty. If the agents have…

综合金融 · 定量金融 2012-10-23 Ulrich Horst , Michael Kupper , Andrea Macrina , Christoph Mainberger

This paper develops a general approach, rooted in statistical learning theory, to learning an approximately revenue-maximizing auction from data. We introduce $t$-level auctions to interpolate between simple auctions, such as welfare…

计算机科学与博弈论 · 计算机科学 2015-06-12 Jamie Morgenstern , Tim Roughgarden

We study a classic Bayesian mechanism design setting of monopoly problem for an additive buyer in the presence of budgets. In this setting a monopolist seller with $m$ heterogeneous items faces a single buyer and seeks to maximize her…

计算机科学与博弈论 · 计算机科学 2018-10-09 Yu Cheng , Nick Gravin , Kamesh Munagala , Kangning Wang

Information technology has revolutionized the traditional structure of markets. The removal of geographical and time constraints has fostered the growth of online auction markets, which now include millions of economic agents worldwide and…

物理与社会 · 物理学 2012-01-20 Filippo Radicchi , Andrea Baronchelli , Luis A. N. Amaral

We study reserve prices in auctions with independent private values when bidders are expectations-based loss averse. We find that the optimal public reserve price excludes fewer bidder types than under risk neutrality. Moreover, we show…

理论经济学 · 经济学 2023-06-16 Benjamin Balzer , Antonio Rosato

We study allocation problems without monetary transfers where agents have correlated types, i.e., hold private information about one another. Such peer information is relevant in various settings, including science funding, allocation of…

理论经济学 · 经济学 2025-03-21 Axel Niemeyer , Justus Preusser

In traditional mechanism design, agents only care about the utility they derive from the outcome of the mechanism. We look at a richer model where agents also assign non-negative dis-utility to the information about their private types…

计算机科学与博弈论 · 计算机科学 2015-03-19 Kobbi Nissim , Claudio Orlandi , Rann Smorodinsky

A canonical setting for non-monetary online resource allocation is one where agents compete over multiple rounds for a single item per round, with i.i.d. valuations and additive utilities across rounds. With $n$ symmetric agents, a natural…

计算机科学与博弈论 · 计算机科学 2025-12-01 David X. Lin , Giannis Fikioris , Siddhartha Banerjee , Éva Tardos

Auctions have been proposed as a way to provide economic incentives for primary users to dynamically allocate unused spectrum to other users in need of it. Previously proposed schemes do not take into account the fact that the power…

计算机科学与博弈论 · 计算机科学 2014-12-24 Deepan Palguna , David J. Love , Ilya Pollak

Maximizing the revenue from selling _more than one_ good (or item) to a single buyer is a notoriously difficult problem, in stark contrast to the one-good case. For two goods, we show that simple "one-dimensional" mechanisms, such as…

计算机科学与博弈论 · 计算机科学 2022-09-22 Sergiu Hart , Noam Nisan

In this paper, we develop a new method for finding an optimal biddingstrategy in sequential auctions, using a dynamic programming technique. Theexisting method assumes that the utility of a user is represented in anadditive form. Thus, the…

计算机科学与博弈论 · 计算机科学 2013-01-14 Hiromitsu Hattori , Makoto Yokoo , Yuko Sakurai , Toramatsu Shintani

A central problem in Microeconomics is to design auctions with good revenue properties. In this setting, the bidders' valuations for the items are private knowledge, but they are drawn from publicly known prior distributions. The goal is to…

计算机科学与博弈论 · 计算机科学 2013-01-11 Sayan Bhattacharya , Janardhan Kulkarni , Xiaoming Xu

Constraints on agent's ability to pay play a major role in auction design for any setting where the magnitude of financial transactions is sufficiently large. Those constraints have been traditionally modeled in mechanism design as…

计算机科学与博弈论 · 计算机科学 2014-04-22 Gagan Goel , Vahab Mirrokni , Renato Paes Leme

If you recommend a product to me and I buy it, how much should you be paid by the seller? And if your sole interest is to maximize the amount paid to you by the seller for a sequence of recommendations, how should you recommend optimally if…

计算机科学与博弈论 · 计算机科学 2009-11-10 Paul Dütting , Monika Henzinger , Ingmar Weber

We study fair allocation of indivisible goods to agents with unequal entitlements. Fair allocation has been the subject of many studies in both divisible and indivisible settings. Our emphasis is on the case where the goods are indivisible…

In fair division problems, the notion of price of fairness measures the loss in welfare due to a fairness constraint. Prior work on the price of fairness has focused primarily on envy-freeness up to one good (EF1) as the fairness…

计算机科学与博弈论 · 计算机科学 2023-07-14 Umang Bhaskar , Neeldhara Misra , Aditi Sethia , Rohit Vaish