Sciweavers

227 search results - page 41 / 46
» Combinatorial Auctions with Budgets
Sort
View
ISSRE
2003
IEEE
14 years 4 months ago
Augmenting Simulated Annealing to Build Interaction Test Suites
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
Myra B. Cohen, Charles J. Colbourn, Alan C. H. Lin...
FOCS
2000
IEEE
14 years 2 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
COLT
2008
Springer
14 years 19 days ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
AAAI
2010
14 years 9 days ago
Hidden Market Design
The next decade will see an abundance of new intelligent systems, many of which will be market-based. Soon, users will interact with many new markets, perhaps without even knowing...
Sven Seuken, Kamal Jain, David C. Parkes
SOFSEM
2009
Springer
14 years 7 months ago
When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures
Abstract. Computational mechanism design (CMD) seeks to understand how to design game forms that induce desirable outcomes in multiagent systems despite private information, self-i...
David C. Parkes