Sciweavers

894 search results - page 128 / 179
» Game Theory with Costly Computation
Sort
View
124
Voted
AAAI
2012
13 years 4 months ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
KDD
2008
ACM
156views Data Mining» more  KDD 2008»
16 years 2 months ago
Can complex network metrics predict the behavior of NBA teams?
The United States National Basketball Association (NBA) is one of the most popular sports league in the world and is well known for moving a millionary betting market that uses th...
Antonio Alfredo Ferreira Loureiro, Pedro O. S. Vaz...
AUTOMOTIVEUI
2009
ACM
15 years 8 months ago
Enhanced auditory menu cues improve dual task performance and are preferred with in-vehicle technologies
Auditory display research for driving has mainly focused on collision warning signals, and recent studies on auditory invehicle information presentation have examined only a limit...
Myounghoon Jeon, Benjamin K. Davison, Michael A. N...
AI
2006
Springer
15 years 1 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
STOC
2012
ACM
251views Algorithms» more  STOC 2012»
13 years 4 months ago
Minimax option pricing meets black-scholes in the limit
Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset’s future market price. In short, an option has...
Jacob Abernethy, Rafael M. Frongillo, Andre Wibiso...