My talk will introduce the problem of computing all Nash equilibria of finite normal form games. I will define a subclass of finite normal form games and present:
- a method for computing all its Nash equilibria and
Most algorithmic problems could be viewed as questions being asked about a natural binary relation and we can classify them into decision, search, uniform generation and counting.
We study the following set membership problem in the bitprobe model: Given a set S from a finite universe U , represent it in memory so that membership queries of the form Is x in S?
(i) We propose and analyze a new scheme for stabilizing the stochastic approximation iterates, viz., an adaptation of step sizes that controls the growth of the iterates without affecting their asymptotic behavior.
Many problems in number theory, discrete geometry, coding theory and combinatorics can be phrased as problems about finding the independence number of certain hypergraphs.
From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed workload distributions, and vice-versa, leading to funda
One of the early motivations for current interest in the stochastic networks community in the study of network models involving long-range-dependent stochastic processes was the observation, based on statistical analysis of data,
In SocG 2009, Mustafa and Ray showed that a local search algorithm is, somewhat surprisingly, a PTAS for certain geometric set cover/hitting set problems.
As computers and networked systems have become an integral part of our daily lives, securing information from unauthorized access, misuse and modification has become very important.
Given a collection of vertices in a network, the problem of finding the minimum cost sub-network connecting a set of client nodes to a dedicated hub-node is the Steiner tree problem. Consider the following two twists.
