93 search results - page 14 / 19 » Online algorithms for market clearing |
87
Voted
WWW
2008
ACM
16 years 2 months ago
2008
ACM
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...
118
click to vote
AAAI
2012
13 years 4 months ago
2012
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
The interaction and integration of agent technology and data mining presents prominent benefits to solve some of challenging issues in individual areas. For instance, data mining ...
136
Voted
ATAL
2004
Springer
15 years 7 months ago
2004
Springer
The problem of interest is how to dynamically allocate wireless access services in a competitive market which implements a take-it-or-leave-it allocation mechanism. In this paper ...
121
click to vote
AAAI
2010
15 years 3 months ago
2010
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...