Sciweavers

80 search results - page 14 / 16
» Bidding algorithms for a distributed combinatorial auction
Sort
View
ATAL
2005
Springer
15 years 2 months ago
Multiagent planning through plan repair
We present a novel approach to multiagent planning for self-interested agents. The main idea behind our approach is that multiagent planning systems should be built upon (single-a...
Roman van der Krogt, Nico Roos, Mathijs de Weerdt,...
IOR
2011
96views more  IOR 2011»
14 years 24 days ago
An Ascending Vickrey Auction for Selling Bases of a Matroid
Consider selling bundles of indivisible goods to buyers with concave utilities that are additively separable in money and goods. We propose an ascending auction for the case when ...
Sushil Bikhchandani, Sven de Vries, James Schummer...
ATAL
2010
Springer
14 years 10 months ago
Honor among thieves: collusion in multi-unit auctions
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
Yoram Bachrach
SIGECOM
2005
ACM
90views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
ICE: an iterative combinatorial exchange
We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive ...
David C. Parkes, Ruggiero Cavallo, Nick Elprin, Ad...
ACMICEC
2007
ACM
127views ECommerce» more  ACMICEC 2007»
15 years 1 months ago
Decentralized task allocation using magnet: an empirical evaluation in the logistics domain
This paper presents a decentralized task allocation method that can handle allocation of tasks with time and precedence constraints in a multi-agent setting where not all informat...
Mark Hoogendoorn, Maria L. Gini, Catholijn M. Jonk...