A-212 (STCS Seminar Room)

Some Algebraic Properties of a Subclass of Finite Normal Form Games

Speaker: 

Ratnik Gandhi Dhirubhai Ambani Institute of Information and Communication Technology Lab 202 Nr. Indroda Circle <b

Time: 

Tuesday, 7 September 2010 (All day)

Venue: 

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

On Stability and Sample Complexity of Stochastic Approximation Iterates

Speaker: 

Sameer Kamal School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road <br

Time: 

Tuesday, 31 August 2010 (All day)

Venue: 

(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.

Persistence of Long-Range-Dependence Under Data Compression

Speaker: 

Venkat Anantharam University of California at Berkeley Electrical Engineering & Computer Science 271, Coray Hall <

Time: 

Tuesday, 3 August 2010 (All day)

Venue: 

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,

Tail-robust Scheduling via Limited Processor Sharing

Speaker: 

Mr. Jayakrishnan Nair California Institute of Technology Department of Electrical Engineering MC 305-16 Pasad

Time: 

Thursday, 5 August 2010 (All day)

Venue: 

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

QIP = PSPACE

Speaker: 

Rahul Jain National University of Singapore Department of Computer Science S15#04-01, 3 Science Drive 2 Singa

Time: 

Wednesday, 14 July 2010 (All day)

Venue: 

We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE.

On Universal and Differentially Private Steiner Trees and TSPs

Speaker: 

Deeparnab Chakrabarty University of Pennsylvania Department of Computer and Information Sciences Philadelphia

Time: 

Thursday, 22 July 2010 (All day)

Venue: 

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.

Pages

Subscribe to RSS - A-212 (STCS Seminar Room)