Knapsack auctions

DOI10.1145/1109557.1109677zbMath1192.91096OpenAlexW4240296182MaRDI QIDQ3583425

Gagan Aggarwal, Jason D. Hartline

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109677

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items

Packing Under Convex Quadratic Constraints ⋮ The Subset Sum game ⋮ Ex-post optimal knapsack procurement ⋮ Strategies in competing subset selection ⋮ Modularity and greed in double auctions ⋮ The power of fair pricing mechanisms ⋮ Competitive subset selection with two agents ⋮ Prior-free multi-unit auctions with ordered bidders ⋮ On the complexity of the highway problem ⋮ Envy freedom and prior-free mechanism design ⋮ Competitive auctions ⋮ Bayesian optimal knapsack procurement ⋮ On fair price discrimination in multi-unit markets ⋮ Worst-Case Mechanism Design via Bayesian Analysis ⋮ On social envy-freeness in multi-unit markets ⋮ On core-selecting and core-competitive mechanisms for binary single-parameter auctions ⋮ Prompt Mechanism for Online Auctions with Multi-unit Demands ⋮ Prompt mechanism for online auctions with multi-unit demands ⋮ Packing under convex quadratic constraints

This page was built for publication: Knapsack auctions