Approximation algorithms for a winner determination problem of single-item multi-unit auctions

DOI10.14495/JSIAML.3.29MaRDI QIDQ2843172zbMATH OpenOpenAlexFDO

Authors Satoshi Takahashi, Maiko Shigeno

Publication date 9 August 2013

Published in JSIAM Letters (Search for Journal in Brave)

Full work available at URL https://www.jstage.jst.go.jp/A_PRedirectJournalInit?sryCd=jsiaml&kijiCd=3_0_29&screenID=AF06S010&noVol=3&noIssue=0

zbMATH Keywords

approximation algorithmauction theorywinner determination

Mathematics Subject Classification ID

Dynamic programming (90C39) Computational methods for problems pertaining to game theory, economics, and finance (91-08) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Energy Prosumers : Profiling the Energy Microgeneration Market In Lower Silesia, Poland
• scientific article; zbMATH DE number 2080339
• An Efficient Winner Approximation for a Series of Combinatorial Auctions
• scientific article; zbMATH DE number 1833405
• Algorithm for optimal winner determination in combinatorial auctions
• Approximation algorithms for combinatorial auctions with complement-free bidders
• Approximation algorithms for combinatorial auctions with complement-free bidders
• Simple and nearly optimal multi-item auctions
• scientific article; zbMATH DE number 7053320
• A universally-truthful approximation scheme for multi-unit auctions

Cited in

(9)

• Time bounds for iterative auctions: a unified approach by discrete convex analysis
• On the fastest Vickrey algorithm
• A multiple-choice secretary algorithm with applications to online auctions
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders
• Energy Prosumers : Profiling the Energy Microgeneration Market In Lower Silesia, Poland
• An Efficient Winner Approximation for a Series of Combinatorial Auctions
• Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems
• Computing and Combinatorics

This page was built for publication: Approximation algorithms for a winner determination problem of single-item multi-unit auctions

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