Sciweavers

76 search results - page 3 / 16
» Parameterizing the winner determination problem for combinat...
Sort
View
ATAL
2007
Springer
13 years 11 months ago
Bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
Benito Mendoza García, José M. Vidal

Lecture Notes
357views
15 years 4 months ago
Computational Mechanism Design
Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency Ph.D. dissertation, Univesity of Pennsylvania, May, 2001. The focus of this chapter is on the Gen...
David Parkes
ATAL
2008
Springer
13 years 7 months ago
Approximate bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
Benito Mendoza García, José M. Vidal
WLP
2005
Springer
13 years 10 months ago
Expressing Interaction in Combinatorial Auction through Social Integrity Constraints
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
Marco Alberti, Federico Chesani, Alessio Guerri, M...
IAT
2006
IEEE
13 years 11 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...