Sciweavers

203 search results - page 14 / 41
» A New Derandomization of Auctions
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Approximating mixed Nash equilibria using smooth fictitious play in simultaneous auctions
We investigate equilibrium strategies for bidding agents that participate in multiple, simultaneous second-price auctions with perfect substitutes. For this setting, previous rese...
Enrico H. Gerding, Zinovi Rabinovich, Andrew Byde,...
AAAI
2010
13 years 9 months ago
Sequential Incremental-Value Auctions
We study the distributed allocation of tasks to cooperating robots in real time, where each task has to be assigned to exactly one robot so that the sum of the latencies of all ta...
Xiaoming Zheng, Sven Koenig
JSSPP
2010
Springer
13 years 5 months ago
A Greedy Double Auction Mechanism for Grid Resource Allocation
To improve the resource utilization and satisfy more users, a Greedy Double Auction Mechanism(GDAM) is proposed to allocate resources in grid environments. GDAM trades resources at...
Ding Ding, Siwei Luo, Zhan Gao
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
14 years 7 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
ECWEB
2003
Springer
151views ECommerce» more  ECWEB 2003»
14 years 21 days ago
A Combinatorial Exchange for Autonomous Traders
Abstract. Combinatorial exchanges have attracted much attention recently. However, to this point there is no generally accepted payment allocation algorithm capable of clearing com...
Andreas Tanner, Gero Mühl