Timezone: »
Poster
Posted Pricing and Dynamic Prior-independent Mechanisms with Value Maximizers
Yuan Deng · Vahab Mirrokni · Hanrui Zhang
@
We study posted price auctions and dynamic prior-independent mechanisms for (ROI-constrained) value maximizers. In contrast to classic (quasi-linear) utility maximizers, these agents aim to maximize their total value subject to a minimum ratio of value per unit of payment made. When personalized posted prices are allowed, posted price auctions for value maximizers can be reduced to posted price auctions for utility maximizers. However, for anonymous posted prices, the well-known $\frac 1 2$ approximation for utility maximizers is impossible for value maximizers and we provide a posted price mechanism with $\frac12(1 - 1/e)$ approximation. Moreover, we demonstrate how to apply our results to design prior-independent mechanisms in a dynamic environment; and to the best of our knowledge, this gives the first constant revenue approximation with multiple value maximizers. Finally, we provide an extension to combinatorial auctions with submodular / XOS agents.
Author Information
Yuan Deng (Google Research)
Vahab Mirrokni (Google Research)
Hanrui Zhang (Carnegie Mellon University)
More from the Same Authors
-
2022 : Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank »
Alessandro Epasto · Vahab Mirrokni · Bryan Perozzi · Anton Tsitsulin · Peilin Zhong -
2022 Poster: Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank »
Alessandro Epasto · Vahab Mirrokni · Bryan Perozzi · Anton Tsitsulin · Peilin Zhong -
2022 Poster: Stars: Tera-Scale Graph Building for Clustering and Learning »
CJ Carey · Jonathan Halcrow · Rajesh Jayaram · Vahab Mirrokni · Warren Schudy · Peilin Zhong -
2022 Poster: Near-Optimal Private and Scalable $k$-Clustering »
Vincent Cohen-Addad · Alessandro Epasto · Vahab Mirrokni · Shyam Narayanan · Peilin Zhong -
2022 Poster: Anonymous Bandits for Multi-User Systems »
Hossein Esfandiari · Vahab Mirrokni · Jon Schneider -
2022 Poster: Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth »
Laxman Dhulipala · David Eisenstat · Jakub Lacki · Vahab Mirrokni · Jessica Shi -
2022 Poster: Cluster Randomized Designs for One-Sided Bipartite Experiments »
Jennifer Brennan · Vahab Mirrokni · Jean Pouget-Abadie -
2021 Poster: Automated Dynamic Mechanism Design »
Hanrui Zhang · Vincent Conitzer -
2021 Poster: Robust Auction Design in the Auto-bidding World »
Santiago Balseiro · Yuan Deng · Jieming Mao · Vahab Mirrokni · Song Zuo -
2021 Poster: Prior-independent Dynamic Auctions for a Value-maximizing Buyer »
Yuan Deng · Hanrui Zhang -
2021 Poster: Synthetic Design: An Optimization Approach to Experimental Design with Synthetic Controls »
Nick Doudchenko · Khashayar Khosravi · Jean Pouget-Abadie · Sébastien Lahaie · Miles Lubin · Vahab Mirrokni · Jann Spiess · guido imbens -
2021 Poster: Parallelizing Thompson Sampling »
Amin Karbasi · Vahab Mirrokni · Mohammad Shadravan -
2020 Poster: Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments »
Steven Jecmen · Hanrui Zhang · Ryan Liu · Nihar Shah · Vincent Conitzer · Fei Fang -
2019 Poster: Distinguishing Distributions When Samples Are Strategically Transformed »
Hanrui Zhang · Yu Cheng · Vincent Conitzer -
2019 Poster: Prior-Free Dynamic Auctions with Low Regret Buyers »
Yuan Deng · Jon Schneider · Balasubramanian Sivan -
2019 Poster: Strategizing against No-regret Learners »
Yuan Deng · Jon Schneider · Balasubramanian Sivan -
2019 Oral: Strategizing against No-regret Learners »
Yuan Deng · Jon Schneider · Balasubramanian Sivan -
2019 Poster: A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions »
Yuan Deng · Sébastien Lahaie · Vahab Mirrokni -
2019 Poster: Provably Efficient Q-learning with Function Approximation via Distribution Shift Error Checking Oracle »
Simon Du · Yuping Luo · Ruosong Wang · Hanrui Zhang