Sciweavers

533 search results - page 60 / 107
» Playing games with approximation algorithms
Sort
View
JMLR
2010
99views more  JMLR 2010»
13 years 2 months ago
An Efficient Explanation of Individual Classifications using Game Theory
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
Erik Strumbelj, Igor Kononenko
JUCS
2007
105views more  JUCS 2007»
13 years 7 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 2 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
ALDT
2011
Springer
251views Algorithms» more  ALDT 2011»
12 years 7 months ago
Game Theory and Human Behavior: Challenges in Security and Sustainability
Security and sustainability are two critical global challenges that involve the interaction of many intelligent actors. Game theory provides a sound mathematical framework to model...
Rong Yang, Milind Tambe, Manish Jain, Jun-young Kw...
ATAL
2005
Springer
14 years 1 months ago
Approximating state estimation in multiagent settings using particle filters
State estimation consists of updating an agent’s belief given executed actions and observed evidence to date. In single agent environments, the state estimation can be formalize...
Prashant Doshi, Piotr J. Gmytrasiewicz