Prompt Mechanism for Online Auctions with Multi-unit Demands

DOI10.1007/978-3-319-03780-6_11zbMath1408.91097OpenAlexW2399343773MaRDI QIDQ2867113

Xiangzhong Xiang

Publication date: 10 December 2013

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_11

zbMATH Keywords

online auctionsmulti-unit demandsTV ad placement

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Marketing, advertising (90B60) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Cites Work

• Unnamed Item
• Unnamed Item
• Online scheduling with partial job values: does timesharing or randomization help?
• Prompt Mechanism for Ad Placement over Time
• A Near Optimal Scheduler for On-Demand Data Broadcasts
• Knapsack auctions
• Computing and Combinatorics
• STACS 2004
• Prompt Mechanisms for Online Auctions
• Algorithms – ESA 2004

This page was built for publication: Prompt Mechanism for Online Auctions with Multi-unit Demands