Pages that link to "Item:Q1039816"

The following pages link to Using bid data for the management of sequential, multi-unit, online auctions with uniformly distributed bidder valuations (Q1039816):

Displayed 11 items.

• Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning (Q319629) ‎ (← links)
• Optimal bidding in auctions from a game theory perspective (Q320681) ‎ (← links)
• Dynamic lot-sizing in sequential online retail auctions (Q421653) ‎ (← links)
• Auction optimization using regression trees and linear models as integer programs (Q511796) ‎ (← links)
• Analysis and design for multi-unit online auctions (Q1751766) ‎ (← links)
• On bidding for a fixed number of items in a sequence of auctions (Q1926913) ‎ (← links)
• Optimal digital product auctions with unlimited supply and rebidding behavior (Q2070733) ‎ (← links)
• A trading mechanism contingent on several indices (Q2275808) ‎ (← links)
• Dual mechanism for an online retailer (Q2467240) ‎ (← links)
• Optimal Design of Online Sequential Buy-Price Auctions with Consumer Valuation Learning (Q5149552) ‎ (← links)
• Optimal Inventory Control and Allocation for Sequential Internet Auctions (Q5255179) ‎ (← links)