Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems

DOI10.1007/11940128_50MaRDI QIDQ5459144zbMATH OpenOpenAlexFDO

Authors Yunhong Zhou

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_50

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)

Recommendations

• Computing and Combinatorics
• Approximation algorithms for a winner determination problem of single-item multi-unit auctions
• Mechanisms for multi-unit auctions
• Multi-unit auctions with budget limits
• Algorithm Theory - SWAT 2004

Cited in

(2)

• Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
• Computing and Combinatorics

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems

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