Sciweavers

44 search results - page 5 / 9
» Domination Game and an Imagination Strategy
Sort
View
AMEC
2003
Springer
14 years 18 days ago
Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
William E. Walsh, David C. Parkes, Rajarshi Das
GECCO
2003
Springer
283views Optimization» more  GECCO 2003»
14 years 17 days ago
A Game-Theoretic Memory Mechanism for Coevolution
One problem associated with coevolutionary algorithms is that of forgetting, where one or more previously acquired traits are lost only to be needed later. We introduce a new coevo...
Sevan G. Ficici, Jordan B. Pollack
TSMC
2002
182views more  TSMC 2002»
13 years 7 months ago
Bidder's strategy under group-buying auction on the Internet
The group-buying auction is a new kind of dynamic pricing mechanism on the Internet. It is a variant of the sellers' price double auction, which makes the bidders as a group t...
Jian Chen, Xilong Chen, Xiping Song
ATAL
2008
Springer
13 years 9 months ago
Strategyproof deterministic lotteries under broadcast communication
The design of deterministic and fair mechanisms for selection among a set of self-motivated agents based solely on these agents' input is a major challenge in multiagent syst...
Alon Altman, Moshe Tennenholtz
JSAC
2008
121views more  JSAC 2008»
13 years 7 months ago
Network Coding Games with Unicast Flows
Abstract--To implement network coding, users need to coordinate and cooperate with respect to their strategies in terms of duplicating and transmitting side information across spec...
Jennifer Price, Tara Javidi