Repeated Bidding with Dynamic Value

• Tác giả: Rémi Chan-Renous, Alexandre Gilotte, Benjamin Heymann
• Ngôn ngữ: eng
• Ký hiệu phân loại: 018.3 +Catalogs arranged by author, main entry, date, or register number
• Thông tin xuất bản: 2023
• Bộ sưu tập: Metadata
• ID: 197896

Tóm tắt

We consider a repeated auction where the buyer's utility for an item depends on the time that elapsed since his last purchase. We present an algorithm to build the optimal bidding policy, and then, because optimal might be impractical, we discuss the cost for the buyer of limiting himself to shading policies.