Polyhedral Clinching Auctions and the AdWords Polytope
From MaRDI portal
Publication:2796405
DOI10.1145/2757277zbMath1333.91015arXiv1201.0404OpenAlexW1454477978MaRDI QIDQ2796405
Gagan Goel, Renato Paes Leme, Vahab S. Mirrokni
Publication date: 24 March 2016
Published in: Journal of the ACM, Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.0404
Analysis of algorithms and problem complexity (68Q25) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (17)
Polymatroid Prophet Inequalities ⋮ On the stability of generalized second price auctions with budgets ⋮ Polyhedral Clinching Auctions for Two-Sided Markets ⋮ Multiplicative Pacing Equilibria in Auction Markets ⋮ Modularity and greed in double auctions ⋮ A simple mechanism for a budget-constrained buyer ⋮ Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets ⋮ Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions ⋮ Clinching auctions with online supply ⋮ On envy-free revenue approximation for combinatorial buyers with budgets ⋮ On a modification of the VCG mechanism and its optimality ⋮ Polyhedral Clinching Auctions and the AdWords Polytope ⋮ Expressiveness and Robustness of First-Price Position Auctions ⋮ Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets ⋮ Budget feasible mechanisms on matroids ⋮ Mechanisms for combinatorial auctions with budget constraints ⋮ Budget-Management Strategies in Repeated Auctions
Cites Work
- Unnamed Item
- The efficiency of fair division
- Multi-unit auctions with budget limits
- A near Pareto optimal auction with budget constraints
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Sponsored search, market equilibria, and the Hungarian method
- Optimal auctions with financially constrained buyers
- Multiple-Object Auctions with Budget Constrained Bidders
- Polyhedral Clinching Auctions and the AdWords Polytope
- No justified complaints
- Competitive Equilibria in Two-Sided Matching Markets with General Utility Functions
- Budget constrained auctions with heterogeneous items
- An Ascending Vickrey Auction for Selling Bases of a Matroid
- Position Auctions with Budgets: Existence and Uniqueness
- On Multiple Keyword Sponsored Search Auctions with Budgets
- Revenue maximization when bidders have budgets
- Standard Auctions with Financially Constrained Bidders
- Optimal Auction Design
- Rado's theorem for polymatroids
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Efficiency Guarantees in Auctions with Budgets
- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
- A Truthful Mechanism for Offline Ad Slot Scheduling
This page was built for publication: Polyhedral Clinching Auctions and the AdWords Polytope
