Knapsack auctions

DOI10.1145/1109557.1109677MaRDI QIDQ3583425zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(22)

• On fair price discrimination in multi-unit markets
• Packing under convex quadratic constraints
• Prior-free multi-unit auctions with ordered bidders
• Envy freedom and prior-free mechanism design
• On social envy-freeness in multi-unit markets
• Prompt mechanism for online auctions with multi-unit demands
• Ex-post optimal knapsack procurement
• Modularity and greed in double auctions
• The power of fair pricing mechanisms
• Competitive auctions
• Bayesian optimal knapsack procurement
• Prompt Mechanism for Online Auctions with Multi-unit Demands
• The Subset Sum game
• Strategies in competing subset selection
• Worst-case mechanism design via Bayesian analysis
• Packing under convex quadratic constraints
• Competitive subset selection with two agents
• On the complexity of the highway problem
• Transaction fee mechanism design
• Strategies for non-myopic users in EIP-1559
• On the strategyproof allocation of items under a budget constraint
• On core-selecting and core-competitive mechanisms for binary single-parameter auctions

This page was built for publication: Knapsack auctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583425)