Clairvoyant Mechanisms for Online Auctions

DOI10.1007/978-3-319-42634-1_1zbMath1479.91144OpenAlexW2489297279MaRDI QIDQ2817844

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

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)

Cites Work

• Unnamed Item
• Performance guarantees for hierarchical clustering
• Competitive analysis of incentive compatible on-line auctions
• Incremental medians via online bidding
• Unit Cost Buyback Problem
• Online Knapsack Problem with Removal Cost
• Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
• Online Scheduling of Unit Length Jobs with Commitment and Penalties
• Incremental flow
• Incentives in Teams
• The Online Median Problem
• An Incremental Model for Combinatorial Maximization Problems
• Algorithmic Game Theory
• Dynamic Programming and Decision Theory
• Approximation algorithms for hierarchical location problems

This page was built for publication: Clairvoyant Mechanisms for Online Auctions