Sciweavers

612 search results - page 123 / 123
» An Empirical Study of Agent Programs
Sort
View
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 5 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
AI
2002
Springer
13 years 5 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm