227 search results - page 39 / 46 » Combinatorial Auctions with Budgets |
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
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...
AAAI
2010
14 years 11 months ago
2010
We consider the task of assigning experts from a portfolio of specialists in order to solve a set of tasks. We apply a Bayesian model which combines collaborative filtering with a...
80
Voted
IJCAI
2001
14 years 11 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
ATAL
2008
Springer
15 years 3 days ago
2008
Springer
We present mechanisms, architectures, and an implementation addressing challenges with mobile opportunistic commerce centering on markets and mechanisms that support the procureme...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...