Sciweavers

894 search results - page 79 / 179
» Game Theory with Costly Computation
Sort
View
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 7 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
15 years 8 months ago
Anarchy, Stability, and Utopia: Creating Better Matchings
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad
111
Voted
IUI
2003
ACM
15 years 7 months ago
Inferring user goals from personality and behavior in a causal model of user affect
We present a probabilistic model, based on Dynamic Decision Networks, to assess user affect from possible causes of emotional arousal. The model relies on the OCC cognitive theory...
Xiaoming Zhou, Cristina Conati
123
Voted
WINE
2010
Springer
152views Economy» more  WINE 2010»
14 years 11 months ago
Collusion in VCG Path Procurement Auctions
We consider collusion in path procurement auctions, where payments are determined using the VCG mechanism. We show that collusion can increase the utility of the agents, and in som...
Yoram Bachrach, Peter Key, Morteza Zadimoghaddam
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 2 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...