Sciweavers

960 search results - page 145 / 192
» Business Value Game
Sort
View
AAAI
2012
11 years 11 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...
ATAL
2006
Springer
14 years 15 days ago
The communication complexity of coalition formation among autonomous agents
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
Ariel D. Procaccia, Jeffrey S. Rosenschein
BMCBI
2002
131views more  BMCBI 2002»
13 years 8 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida
INFOCOM
2010
IEEE
13 years 7 months ago
Utility Maximization for Delay Constrained QoS in Wireless
Abstract—This paper studies the problem of utility maximization for clients with delay based QoS requirements in wireless networks. We adopt a model used in a previous work that ...
I-Hong Hou, P. R. Kumar
MONET
2011
13 years 3 months ago
Jamming in Wireless Networks Under Uncertainty
— The problem of jamming plays an important role in ensuring the quality and security of wireless communications, especially at this moment when wireless networks are quickly bec...
Eitan Altman, Konstantin Avrachenkov, Andrey Garna...