activity
20112022
most citedWhen to look at a noisy Markov chain in sequential decision making if measurements are costly?

6 citations · 26 across the 23 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

eess.SY20192 cited

What Did Your Adversary Believe? Optimal Filtering and Smoothing in Counter-Adversarial Autonomous Systems

Robert Mattila, Inês Lourenço, Vikram Krishnamurthy +2

We consider fixed-interval smoothing problems for counter-adversarial autonomous systems. An adversary deploys an autonomous filtering and control system that i) measures our curre…

cs.LG2019

Rationally Inattentive Inverse Reinforcement Learning Explains YouTube Commenting Behavior

William Hoiles, Vikram Krishnamurthy, Kunal Pattanayak

We consider a novel application of inverse reinforcement learning with behavioral economics constraints to model, learn and predict the commenting behavior of YouTube viewers. Each…

cs.SI2019

Maximum Likelihood Estimation of Power-law Degree Distributions via Friendship Paradox based Sampling

Buddhika Nettasinghe, Vikram Krishnamurthy

This paper considers the problem of estimating a power-law degree distribution of an undirected network using sampled data. Although power-law degree distributions are ubiquitous i…

cs.SI2019

Friendship Paradox Biases Perceptions in Directed Networks

Nazanin Alipourfard, Buddhika Nettasinghe, Andres Abeliuk +2

How popular a topic or an opinion appears to be in a network can be very different from its actual popularity. For example, in an online network of a social media platform, the num…

eess.SP2019

How to Calibrate your Adversary's Capabilities? Inverse Filtering for Counter-Autonomous Systems

Vikram Krishnamurthy, Muralidhar Rangaswamy

We consider an adversarial Bayesian signal processing problem involving "us" and an "adversary". The adversary observes our state in noise; updates its posterior distribution of th…