Sciweavers

5995 search results - page 62 / 1199
» Algorithmic Game Theory
Sort
View
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
15 years 1 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella
CORR
2007
Springer
141views Education» more  CORR 2007»
14 years 11 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux
TON
2002
148views more  TON 2002»
14 years 11 months ago
Internet pricing with a game theoretical approach: concepts and examples
The basic concepts of three branches of game theory, leader
Xi-Ren Cao, Hong-Xia Shen, Rodolfo A. Milito, Patr...
SAGT
2009
Springer
112views Game Theory» more  SAGT 2009»
15 years 6 months ago
On the Complexity of Iterated Weak Dominance in Constant-Sum Games
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...
EJC
2008
14 years 11 months ago
Eriksson's numbers game and finite Coxeter groups
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
Robert G. Donnelly