We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Da...
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Motivation to learn is affected by a student’s self-efficacy, goal orientation, locus of control and perceived task difficulty. In the classroom, teachers know how to motivate th...
Content adaptation is an effective solution to support the quality of service for multimedia services over heterogeneous networks. This paper deals with the accuracy and the real-...
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...