Computing simple mechanisms: Lift-and-round over marginal reduced forms
type: Item
instance of: scholarly article
title: Computing simple mechanisms: Lift-and-round over marginal reduced forms
arXiv ID: 2111.03962
DOI: 10.1145/3519935.3520029
author: Yang Cai
author: Q6083524
author: Mingfei Zhao
published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
publication date: 2023-12-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/2111.03962
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7774372
zbMATH Keywords: computational complexity
zbMATH Keywords: linear program lifting
zbMATH Keywords: revenue maximization
zbMATH Keywords: simple and approximately optimal auctions
zbMATH Keywords: XOS valuations
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3214108496
Recommended article: On the computational complexity of optimal simple mechanisms
Recommended article: Multidimensional Mechanism Design: Finite-Dimensional Approximations and Efficient Computation
Recommended article: Computing Simply Stable Equilibria
Recommended article: A note on the tight simplification of mechanisms
Recommended article: Efficient Computation of Optimal Auctions via Reduced Forms
Recommended article: Computing equilibria: a computational complexity perspective
Recommended article: Approximation Techniques for Utilitarian Mechanism Design
Recommended article: Approximation techniques for utilitarian mechanism design
Recommended article: Computational techniques for a simple theory of conditional preferences
Recommended article: Reducing mechanism design to algorithm design via machine learning
description: scientific article; zbMATH DE number 7774372