Pages that link to "Item:Q3114815"

The following pages link to Optimal Dynamic Auctions for Revenue Management (Q3114815):

Displaying 24 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)
• Efficiency levels in sequential auctions with dynamic arrivals (Q480844) (← links)
• Auctions with dynamic populations: efficiency and revenue maximization (Q694743) (← links)
• A dynamic model for optimal design quality and return policies (Q872135) (← links)
• Optimal dynamic mechanism design with deadlines (Q899681) (← links)
• Using bid data for the management of sequential, multi-unit, online auctions with uniformly distributed bidder valuations (Q1039816) (← links)
• Prisoner's dilemma game model for e-commerce (Q1732827) (← links)
• Reserve prices in repeated auctions (Q1742150) (← links)
• On bidding for a fixed number of items in a sequence of auctions (Q1926913) (← links)
• The secretary problem with multiple job vacancies and batch candidate arrivals (Q2060597) (← links)
• Optimal digital product auctions with unlimited supply and rebidding behavior (Q2070733) (← links)
• On incentive compatibility in dynamic mechanism design with exit option in a Markovian environment (Q2150676) (← links)
• Dynamic procurement management by reverse auctions with fixed setup costs and sales levers (Q2289310) (← links)
• The return function: a new computable perspective on Bayesian-Nash equilibria (Q2312340) (← links)
• Optimal inventory control with fixed ordering cost for selling by Internet auctions (Q2358842) (← links)
• Dual mechanism for an online retailer (Q2467240) (← links)
• Monitoring the market or the salesperson? The value of information in a multilayer supply chain (Q2892134) (← links)
• Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy (Q4994149) (← links)
• Dynamic Double Auctions: Toward First Best (Q5106370) (← links)
• Dynamic Mechanism Design with Budget-Constrained Buyers Under Limited Commitment (Q5126629) (← links)
• Robust Dynamic Pricing with Strategic Customers (Q5219692) (← links)
• Optimal Inventory Control and Allocation for Sequential Internet Auctions (Q5255179) (← links)