Sciweavers

5995 search results - page 10 / 1199
» Algorithmic Game Theory
Sort
View
SAGT
2010
Springer
156views Game Theory» more  SAGT 2010»
13 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
FOSSACS
2009
Springer
14 years 2 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
ICPP
2009
IEEE
14 years 2 months ago
Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
Jonathan Widger, Daniel Grosu

Lab
652views
15 years 6 months ago
Electronic Enterprises Laboratory
Our research is motivated by a strong conviction that business processes in electronic enterprises can be designed to deliver high levels of performance through the use of mathemat...
SAGT
2010
Springer
127views Game Theory» more  SAGT 2010»
13 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