No article text was recorded for this version.
combinatorial auction complexity
Version 1 of 1262 papers356 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Optimal Pricing Is Hard
- Blog: Efficiency of Constant Log Utility Market Makers
- Blog: Contextual Reserve Price Optimization in Auctions via Mixed Integer Programming
- Blog: Hardness of the Pricing Problem for Chains in Barter Exchanges
- Blog: Signaling Schemes for Revenue Maximization
- Blog: Combinatorial Auctions with k-wise Dependent Valuations
- Blog: Arbitrage-Free Combinatorial Market Making via Integer Programming
- Blog: On Revenue Maximization with Sharp Multi-Unit Demands
- Blog: Contextual Reserve Price Optimization in Auctions
- Blog: A Field Guide to Personalized Reserve Prices
- Blog: On the complexity of dynamic mechanism design
- Blog: Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions
- Blog: Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer
- Blog: Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
- Blog: Public Signaling in Bayesian Ad Auctions
- Blog: On the Complexity of Bundle-Pricing and Simple Mechanisms
- Blog: Complexity of combinatorial market makers
- Blog: Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
- Blog: The Complexity of Optimal Mechanism Design
- Blog: Combinatorial auctions with decreasing marginal utilities
- Blog: The Complexity of Optimal Mechanism Design
- Blog: Signaling Schemes for Revenue Maximization
- Blog: Some Tractable Combinatorial Auctions
- Blog: Pricing and clearing combinatorial markets with singleton and swap orders: Efficient algorithms for the futures opening auction problem
- Blog: iBundler: An Agent-Based Decision Support Service for Combinatorial Negotiations
- Blog: Frugality ratios and improved truthful mechanisms for vertex cover
- Blog: A Simple and Approximately Optimal Mechanism for a Buyer with Complements
- Blog: Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer
- Blog: Signaling in Posted Price Auctions
- Blog: Bid optimization for broad match ad auctions
- Blog: Bid Optimization in Broad-Match Ad Auctions
- Blog: An Algorithm for Optimal Winner Determination in
- Blog: Exploring Leximin Principle for Fair Core-Selecting Combinatorial Auctions: Payment Rule Design and Implementation
- Blog: Computational Aspects of Mechanism Design
- Blog: Combinatorial Auctions with Decreasing Marginal Utilities
- Blog: Designing Informative Securities
- Blog: The Pseudo-Dimension of Near-Optimal Auctions
- Blog: Strategic Recommendation: Revenue Optimal Matching for Online Platforms (Student Abstract)
- Blog: Toward Expressive and Scalable Sponsored Search Auctions
- Blog: Revenue Maximization via Hiding Item Attributes
- Blog: Tight Inapproximability for Welfare-Maximizing Autobidding Equilibria
- Blog: Complexity of Combinatorial Market Makers
- Blog: Complexity of Combinatorial Market Makers
- Blog: On the complexity of dynamic mechanism design
- Blog: A Field Guide to Personalized Reserve Prices
- Blog: Near-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions
- Blog: Methods for Boosting Revenue in Combinatorial Auctions
- Blog: Taming the Computational Complexity of
- Blog: CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
- Blog: Google’s Auction for TV Ads
- Blog: Pricing Randomized Allocations
- Blog: Iterative Combinatorial Auctions: Theory and Practice
- Blog: The Intractability of Dynamic Mechanism Design
- Blog: Thinking Twice about Second-Price Ad Auctions
- Blog: Budget Feasible Mechanism Design via Random Sampling
- Blog: Towards Better Models of Externalities in Sponsored Search Auctions
- Blog: Optimal Auctions with Correlated Bidders are Easy
- Blog: The Intractability of Dynamic Mechanism Design
- Blog: On the Complexity of Dynamic Mechanism Design
- Blog: eMediator: a Next Generation Electronic Commerce Server
Showing 60 of 262 papers.
History & citation
Current · Permanent link
- This direction split from Revenue Maximization in Multi-Item Auctions (79% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_combinatorial_auction_complexity_08efbf31,
title = {combinatorial auction complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/combinatorial-auction-complexity/rdr_08efbf31067849d4ae6a96f35e4f4042},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_combinatorial_auction_complexity_08efbf31_v1,
title = {combinatorial auction complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/combinatorial-auction-complexity/rdr_08efbf31067849d4ae6a96f35e4f4042/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}