Sciweavers

131 search results - page 19 / 27
» Designing Auctions for Deliberative Agents
Sort
View
AAAI
2000
13 years 9 months ago
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
Tuomas Sandholm, Subhash Suri
AAAI
2007
13 years 9 months ago
Automated Online Mechanism Design and Prophet Inequalities
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tu...
ATAL
2008
Springer
13 years 9 months ago
An interactive platform for auction-based allocation of loads in transportation logistics
This paper describes an agent-based platform for the allocation of loads in distributed transportation logistics, developed as a collaboration between CWI, Dutch National Center f...
Valentin Robu, Han Noot, Han La Poutré, Wil...
ATAL
2003
Springer
14 years 23 days ago
Role-assignment in open agent societies
Open systems are characterized by heterogeneous participants which can enter or leave the system at will. Typical examples are e-commerce applications or information agent systems...
Mehdi Dastani, Virginia Dignum, Frank Dignum
ATAL
2010
Springer
13 years 8 months ago
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori...