Sciweavers

9176 search results - page 1552 / 1836
» algorithms 2010
Sort
View
SAGT
2010
Springer
191views Game Theory» more  SAGT 2010»
15 years 5 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
SAGT
2010
Springer
156views Game Theory» more  SAGT 2010»
15 years 5 months ago
Partition Equilibrium Always Exists in Resource Selection Games
Abstract. We consider the existence of Partition Equilibrium in Resource Selection Games. Super-strong equilibrium, where no subset of players has an incentive to change their stra...
Elliot Anshelevich, Bugra Caskurlu, Ameya Hate
SAGT
2010
Springer
127views Game Theory» more  SAGT 2010»
15 years 5 months ago
On the Rate of Convergence of Fictitious Play
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the...
Felix Brandt, Felix A. Fischer, Paul Harrenstein
SAS
2010
Springer
159views Formal Methods» more  SAS 2010»
15 years 5 months ago
Automatic Abstraction for Intervals Using Boolean Formulae
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
Jörg Brauer, Andy King
SCIENTOMETRICS
2010
158views more  SCIENTOMETRICS 2010»
15 years 5 months ago
Rete-netzwerk-red: analyzing and visualizing scholarly networks using the Network Workbench Tool
The enormous increase in digital scholarly data and computing power combined with recent advances in text mining, linguistics, network science, and scientometrics make it possible...
Katy Börner, Weixia Huang, Micah Linnemeier, ...
« Prev « First page 1552 / 1836 Last » Next »