Sciweavers

1616 search results - page 63 / 324
» Robust game theory
Sort
View
SBP
2011
Springer
12 years 10 months ago
Consumer Search, Rationing Rules, and the Consequence for Competition
Abstract. Firms’ conjectures about demand are consequential in oligopoly games. Through agent-based modeling of consumers’ search for products, we can study the rationing of de...
Christopher S. Ruebeck
CSE
2009
IEEE
14 years 2 months ago
Parallel Computation of Nash Equilibria in N-Player Games
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
Jonathan Widger, Daniel Grosu
ICTAI
2009
IEEE
14 years 2 months ago
Translation of an Argumentation Framework into a CP-Boolean Game
Abstract—There already exist some links between argumentation and game theory. For instance, dynamic games can be used for simulating interactions between agents in an argumentat...
Elise Bonzon, Caroline Devred, Marie-Christine Lag...
ENTCS
2008
106views more  ENTCS 2008»
13 years 7 months ago
Computability and Representations of the Zero Set
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
Pieter Collins
LICS
2008
IEEE
14 years 2 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski