We consider a fundamental pricing problem in combinatorial auctions. are given set of indivisible items and buyers with randomly drawn monotone valuations over subsets items. A decision maker sets item prices then the make sequential purchasing decisions, taking their favorite among remaining parametrize an instance by d, size largest buyer may want. Our main result asserts that there exist suc...

We study optimal pricing in a single server queue when the customers valuation of service depends on their waiting time. In particular, we consider very general model, where customer valuations are random and sampled from distribution that length. The goal provider is to set dynamic state dependent prices order maximize its revenue, while also managing congestion. model problem as Markov decisi...

Abstract Assume that customers are price sensitive, changes in the price of perishable products will bring changes in demand, and business can adjust the perishable products' price to influence the market demand, a perishable products multi-stage pricing model considering cancelations and no-shows is proposed, and the optimal pricing, the optimal expected revenue with the products' initial quan...