Sciweavers

14084 search results - page 107 / 2817
» A Theory for Game Theories
Sort
View
SAGT
2010
Springer
191views Game Theory» more  SAGT 2010»
13 years 6 months ago
Complexity of Safe Strategic Voting
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
Noam Hazon, Edith Elkind
FOCS
2007
IEEE
14 years 2 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
ATAL
2003
Springer
14 years 1 months ago
A selection-mutation model for q-learning in multi-agent systems
Although well understood in the single-agent framework, the use of traditional reinforcement learning (RL) algorithms in multi-agent systems (MAS) is not always justified. The fe...
Karl Tuyls, Katja Verbeeck, Tom Lenaerts
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
14 years 2 months ago
Better with Byzantine: Manipulation-Optimal Mechanisms
Abstract. A mechanism is manipulable if it is in some agents’ best interest to misrepresent their private information. The revelation principle establishes that, roughly, anythin...
Abraham Othman, Tuomas Sandholm
SAGT
2009
Springer
176views Game Theory» more  SAGT 2009»
14 years 2 months ago
Bayesian Auctions with Friends and Foes
We study auctions whose bidders are embedded in a social or economic network. As a result, even bidders who do not win the auction themselves might derive utility from the auction,...
Po-An Chen, David Kempe