Clairvoyant mechanisms for online auctions

DOI10.1007/978-3-319-42634-1_1MaRDI QIDQ2817844zbMATH OpenOpenAlexFDO

Authors Philipp Brandes, Zengfeng Huang, Hsin-Hao Su, Roger Wattenhofer

Publication date 2 September 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-42634-1_1

Mathematics Subject Classification ID

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

Recommendations

• Prompt Mechanisms for Online Auctions
• Non-clairvoyant dynamic mechanism design
• Near-optimal online auctions
• Online mechanism design (randomized rounding on the fly)
• scientific article; zbMATH DE number 2119761

Cites work

• Algorithmic Game Theory
• An Incremental Model for Combinatorial Maximization Problems
• Approximation algorithms for hierarchical location problems
• Buyback problem -- approximate matroid intersection with cancellation costs
• Competitive analysis of incentive compatible on-line auctions
• Dynamic Programming and Decision Theory
• Incentives in Teams
• Incremental flow
• Incremental medians via online bidding
• Online ascending auctions for gradually expiring items
• Online knapsack problem with removal cost
• Online scheduling of unit length jobs with commitment and penalties
• Performance guarantees for hierarchical clustering
• The Online Median Problem
• Unit cost buyback problem

Cited in

(1)

• Bidding agents for online auctions with hidden bids

This page was built for publication: Clairvoyant mechanisms for online auctions

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