227 search results - page 21 / 46 » Combinatorial Auctions with Budgets |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
WINE
2005
Springer
15 years 3 months ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
90
Voted
AAAI
2004
14 years 11 months ago
2004
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
One of the Multi-Agent Systems that is widely used by various government agencies, buyers and sellers in a market economy, in such a manner so as to attain optimized resource allo...
SIGECOM
2004
ACM
15 years 3 months ago
2004
ACM
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...