English
Related papers

Related papers: Learning Truthful, Efficient, and Welfare Maximizi…

200 papers

As computational agents are developed for increasingly complicated e-commerce applications, the complexity of the decisions they face demands advances in artificial intelligence techniques. For example, an agent representing a seller in an…

Artificial Intelligence · Computer Science 2017-01-08 W. P. Birmingham , E. H. Durfee , S. Park

We provide algorithms that learn simple auctions whose revenue is approximately optimal in multi-item multi-bidder settings, for a wide range of valuations including unit-demand, additive, constrained additive, XOS, and subadditive. We…

Computer Science and Game Theory · Computer Science 2017-09-04 Yang Cai , Constantinos Daskalakis

Current methodologies in machine learning analyze the effects of various statistical parity notions of fairness primarily in light of their impacts on predictive accuracy and vendor utility loss. In this paper, we propose a new framework…

Machine Learning · Computer Science 2018-07-04 Lily Hu , Yiling Chen

Crowdsourcing has become an important tool to collect data for various artificial intelligence applications and auction can be an effective way to allocate work and determine reward in a crowdsourcing platform. In this paper, we focus on…

Computer Science and Game Theory · Computer Science 2022-02-22 Timothy Shin Heng Mak , Albert Y. S. Lam

Designing truthful, revenue maximizing auctions is a core problem of auction design. Multi-item settings have long been elusive. Recent work (arXiv:1706.03459) introduces effective deep learning techniques to find such auctions for the…

Computer Science and Game Theory · Computer Science 2021-04-02 Daniel Reusche , Nicolás Della Penna

Single-shot auctions are commonly used as a means to sell goods, for example when selling ad space or allocating radio frequencies, however devising mechanisms for auctions with multiple bidders and multiple items can be complicated. It has…

Machine Learning · Computer Science 2023-03-02 Alex Stein , Avi Schwarzschild , Michael Curry , Tom Goldstein , John Dickerson

Auction-based Federated Learning (AFL) enables open collaboration among self-interested data consumers and data owners. Existing AFL approaches are commonly under the assumption of sellers' market in that the service clients as sellers are…

Machine Learning · Computer Science 2023-09-12 Jiaxi Yang , Zihao Guo , Sheng Cao , Cuifang Zhao , Li-Chuan Tsai

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

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…

Computer Science and Game Theory · Computer Science 2012-07-09 Jonathan Bredin , David C. Parkes

In this paper, we design a deep learning based resource allocation framework, in the form of an auction, for simultaneous information and power transfer from a hybrid access point (AP) to information devices and energy harvesting devices,…

Signal Processing · Electrical Eng. & Systems 2021-07-08 Ali Bayat , Sonia Aissa

We study the bidding problem in repeated uniform price multi-unit auctions from the perspective of a value-maximizing buyer. The buyer aims to maximize their cumulative value over $T$ rounds while adhering to per-round return-on-investment…

Data Structures and Algorithms · Computer Science 2025-10-07 Negin Golrezaei , Sourav Sahoo

We study the design of loss functions for click-through rates (CTR) to optimize (social) welfare in advertising auctions. Existing works either only focus on CTR predictions without consideration of business objectives (e.g., welfare) in…

Computer Science and Game Theory · Computer Science 2023-06-06 Boxiang Lyu , Zhe Feng , Zachary Robertson , Sanmi Koyejo

We consider the design of computationally efficient online learning algorithms in an adversarial setting in which the learner has access to an offline optimization oracle. We present an algorithm called Generalized…

We study a setting where agents use no-regret learning algorithms to participate in repeated auctions. \citet{kolumbus2022auctions} showed, rather surprisingly, that when bidders participate in second-price auctions using no-regret bidding…

Computer Science and Game Theory · Computer Science 2024-11-15 Gagan Aggarwal , Anupam Gupta , Andres Perlroth , Grigoris Velegkas

We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and the seller must make the allocation and payment decisions…

Computer Science and Game Theory · Computer Science 2009-05-22 Moshe Babaioff , Liad Blumrosen , Aaron L. Roth

Consider the problem of allocating goods to buyers through an auction. An auction is efficient if the resulting allocation maximizes total welfare, conditional on the information available. If buyers have private values, the…

Computer Science and Game Theory · Computer Science 2018-05-23 Andrei Ciupan

We present a new approach to machine learning-powered combinatorial auctions, which is based on the principles of Differential Privacy. Our methodology guarantees that the auction mechanism is truthful, meaning that rational bidders have…

Computer Science and Game Theory · Computer Science 2024-05-20 Arash Jamshidi , Seyed Mohammad Hosseini , Seyed Mahdi Noormousavi , Mahdi Jafari Siavoshani

Given that Artificial Intelligence (AI) increasingly permeates our lives, it is critical that we systematically align AI objectives with the goals and values of humans. The human-AI alignment problem stems from the impracticality of…

Computers and Society · Computer Science 2022-07-05 John Nay , James Daily

We study autobidding ad auctions with user costs, where each bidder is value-maximizing subject to a return-over-investment (ROI) constraint, and the seller aims to maximize the social welfare taking into consideration the user's cost of…

Computer Science and Game Theory · Computer Science 2023-02-02 Yuan Deng , Jieming Mao , Vahab Mirrokni , Hanrui Zhang , Song Zuo

In online advertising, a set of potential advertisements can be ranked by a certain auction system where usually the top-1 advertisement would be selected and displayed at an advertising space. In this paper, we show a selection bias issue…

Information Retrieval · Computer Science 2022-06-09 Shinya Suzumura , Hitoshi Abe