Sciweavers

467 search results - page 39 / 94
» Online Auction Demand
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Automated negotiation with decommitment for dynamic resource allocation in cloud computing
We consider the problem of allocating networked resources in dynamic environment, such as cloud computing platforms, where providers strategically price resources to maximize thei...
Bo An, Victor R. Lesser, David Irwin, Michael Zink
IADIS
2008
13 years 9 months ago
Online Active Listening And Media Competence
The highly recognized concept of "active listening" is widely adopted in contexts that involve gathering information and solving problems. Demanding both verbal and nonv...
Kathrin Figl, Christine Bauer
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
14 years 1 months ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
JACM
2006
134views more  JACM 2006»
13 years 7 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Selling ad campaigns: online algorithms with cancellations
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...