Sciweavers

1220 search results - page 123 / 244
» Restricting grammatical complexity
Sort
View
JAIR
2011
214views more  JAIR 2011»
14 years 7 months ago
Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...
Dmytro Korzhyk, Zhengyu Yin, Christopher Kiekintve...
NN
2007
Springer
15 years 10 months ago
Impact of Higher-Order Correlations on Coincidence Distributions of Massively Parallel Data
The signature of neuronal assemblies is the higher-order correlation structure of the spiking activity of the participating neurons. Due to the rapid progress in recording technol...
Sonja Grün, Moshe Abeles, Markus Diesmann
ATAL
2010
Springer
15 years 5 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
ICDT
2009
ACM
128views Database» more  ICDT 2009»
16 years 5 months ago
Efficient asymmetric inclusion between regular expression types
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...
Dario Colazzo, Giorgio Ghelli, Carlo Sartiani
ATAL
2009
Springer
15 years 11 months ago
Combinatorial prediction markets for event hierarchies
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
Mingyu Guo, David M. Pennock