Sciweavers

1683 search results - page 54 / 337
» Game Theory Basics
Sort
View
102
Voted
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
15 years 7 months ago
Learning and Approximating the Optimal Strategy to Commit To
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
Joshua Letchford, Vincent Conitzer, Kamesh Munagal...
67
Voted
ATAL
2010
Springer
15 years 1 months ago
Internal implementation
We introduce a constrained mechanism design setting called internal implementation, in which the mechanism designer is explicitly modeled as a player in the game of interest. This...
Ashton Anderson, Yoav Shoham, Alon Altman
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 28 days ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen
105
Voted
IJCAI
2007
15 years 2 months ago
Progression of Situation Calculus Action Theories with Incomplete Information
In this paper, we propose a new progression mechanism for a restricted form of incomplete knowledge formulated as a basic action theory in the situation calculus. Specifically, w...
Stavros Vassos, Hector J. Levesque
79
Voted
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
15 years 6 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...