Given a collection C of weighted subsets of a ground set E, the set cover problem is to find a minimum weight subset of C which covers all elements of E. We study a strategic game ...
We present a game-theoretic treatment of distributed power control in CDMA wireless systems. We make use of the conceptual framework of noncooperative game theory to obtain a distr...
Tansu Alpcan, Tamer Basar, R. Srikant, Eitan Altma...
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Functional programming languages ought to play a central role in mathematics education for middle schools (age range: 10?14). After all, functional programming is a form of algebr...
Matthias Felleisen, Robert Bruce Findler, Matthew ...