English
Related papers

Related papers: Mechanism Design for Auctions with Externalities o…

200 papers

We present a deterministic exploration mechanism for sponsored search auctions, which enables the auctioneer to learn the relevance scores of advertisers, and allows advertisers to estimate the true value of clicks generated at the auction…

Computer Science and Game Theory · Computer Science 2011-11-10 Sudhir Kumar Singh , Vwani P. Roychowdhury , Milan Bradonjić , Behnam A. Rezaei

Exchange markets are a significant type of market economy, in which each agent holds a budget and certain (divisible) resources available for trading. Most research on equilibrium in exchange economies is based on an environment of…

Computer Science and Game Theory · Computer Science 2024-10-10 Yusen Zheng , Yukun Cheng , Chenyang Xu , Xiaotie Deng

We study an abstract optimal auction problem for a single good or service. This problem includes environments where agents have budgets, risk preferences, or multi-dimensional preferences over several possible configurations of the good…

Computer Science and Game Theory · Computer Science 2012-03-23 Saeed Alaei , Hu Fu , Nima Haghpanah , Jason Hartline , Azarakhsh Malekian

While auction theory views bids and valuations as continuous variables, real-world auctions are necessarily discrete. In this paper, we use a combination of analytical and computational methods to investigate whether incorporating…

Theoretical Economics · Economics 2022-08-17 Itzhak Rasooly , Carlos Gavidia-Calderon

The growing demand for data and AI-generated digital goods, such as personalized written content and artwork, necessitates effective pricing and feedback mechanisms that account for uncertain utility and costly production. Motivated by…

Computer Science and Game Theory · Computer Science 2023-06-06 Zachary Robertson , Oluwasanmi Koyejo

In this work we are concerned with the design of efficient mechanisms while eliciting limited information from the agents. First, we study the performance of sampling approximations in facility location games. Our key result is to show that…

Computer Science and Game Theory · Computer Science 2022-08-26 Ioannis Anagnostides , Dimitris Fotakis , Panagiotis Patsilinakos

We introduce a dynamic mechanism design problem in which the designer wants to offer for sale an item to an agent, and another item to the same agent at some point in the future. The agent's joint distribution of valuations for the two…

Computer Science and Game Theory · Computer Science 2023-05-22 Christos Papadimitriou , George Pierrakos , Christos-Alexandros Psomas , Aviad Rubinstein

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…

Computer Science and Game Theory · Computer Science 2015-08-06 George Christodoulou , Alkmini Sgouritsa , Bo Tang

We study non-monetary mechanisms for the fair and efficient allocation of reusable public resources, i.e., resources used for varying durations. We consider settings where a limited resource is repeatedly shared among a set of agents, each…

Computer Science and Game Theory · Computer Science 2023-10-17 Siddhartha Banerjee , Giannis Fikioris , Éva Tardos

This paper presents models for predicted click-through rates in position auctions that take into account two possibilities that are not normally considered---that the identities of ads shown in other positions may affect the probability…

Computer Science and Game Theory · Computer Science 2014-09-17 Patrick Hummel , R. Preston McAfee

In this paper, we show a tight approximation guarantee for budget-feasible mechanisms with an additive buyer. We propose a new simple randomized mechanism with approximation ratio of $2$, improving the previous best known result of $3$. Our…

Computer Science and Game Theory · Computer Science 2020-07-22 Nick Gravin , Yaonan Jin , Pinyan Lu , Chenhao Zhang

We study a participatory budgeting problem of aggregating the preferences of agents and dividing a budget over the projects. A budget division solution is a probability distribution over the projects. The main purpose of our study concerns…

Computer Science and Game Theory · Computer Science 2020-11-02 Zhongzheng Tang , Chenhao Wang , Mengqi Zhang

We study incentive compatible mechanisms for Combinatorial Auctions where the bidders have submodular (or XOS) valuations and are budget-constrained. Our objective is to maximize the \emph{liquid welfare}, a notion of efficiency for…

Computer Science and Game Theory · Computer Science 2018-12-14 Dimitris Fotakis , Kyriakos Lotidis , Chara Podimata

We consider the problem of the optimization of bidding strategies in prior-dependent revenue-maximizing auctions, when the seller fixes the reserve prices based on the bid distributions. Our study is done in the setting where one bidder is…

Computer Science and Game Theory · Computer Science 2019-05-15 Thomas Nedelec , Noureddine El Karoui , Vianney Perchet

We propose a novel family of sales-based rebate mechanisms that induce network effects in sales of products that do not exhibit such externalities. The proposed rebate mechanisms enable the seller of a product with uncertain quality to…

Optimization and Control · Mathematics 2021-10-01 Amir Ajorlou , Ali Jadbabaie

We consider online procurement auctions, where the agents arrive sequentially, in random order, and have private costs for their services. The buyer aims to maximize a monotone submodular value function for the subset of agents whose…

Computer Science and Game Theory · Computer Science 2025-04-15 Andreas Charalampopoulos , Dimitris Fotakis , Panagiotis Patsilinakos , Thanos Tolias

In settings where players have a limited access to liquidity, represented in the form of budget constraints, efficiency maximization has proven to be a challenging goal. In particular, the social welfare cannot be approximated by a better…

Computer Science and Game Theory · Computer Science 2013-04-29 Shahar Dobzinski , Renato Paes Leme

In the standard single-dimensional model of position auctions, bidders agree on the relative values of the positions and each of them submits a single bid that is interpreted in terms of these values. Motivated by current practice in…

Computer Science and Game Theory · Computer Science 2018-06-22 Paul Dütting , Felix Fischer , David C. Parkes

Spectrum auctions are the primary mechanism through which governments allocate scarce radio frequencies, with outcomes that shape competition, coverage, and innovation in telecommunications markets. While traditional models of spectrum…

Computer Science and Game Theory · Computer Science 2025-12-10 Sara Jalili Shani , Kris Joseph , Michael B. McNally , James R. Wright

Designing an incentive-compatible auction mechanism that maximizes the auctioneer's revenue while minimizes the bidders' ex-post regret is an important yet intricate problem in economics. Remarkable progress has been achieved through…

Computer Science and Game Theory · Computer Science 2022-10-12 Tian Qin , Fengxiang He , Dingfeng Shi , Wenbing Huang , Dacheng Tao
‹ Prev 1 4 5 6 7 8 10 Next ›