activity
20222026
most citedNP-Hardness of a 2D, a 2.5D, and a 3D Puzzle Game

1 citations · 2 across the 4 of their papers we have counts for

collaborators

5 papers

cs.LG2026

Learning-Enabled Estimation: Tight Characterizations under Sample Selection Biases

Vikram Kher, Jane H. Lee, Anay Mehrotra +1

When can we learn from biased samples? We study regression when outcomes are observed only after passing through selection filters that depend on both covariates and outcomes thems…

stat.ML2025

Prediction-Augmented Trees for Reliable Statistical Inference

Vikram Kher, Argyris Oikonomou, Manolis Zampetakis

The remarkable success of machine learning (ML) in predictive tasks has led scientists to incorporate ML predictions as a core component of the scientific discovery pipeline. This…

cs.GT2024★ 1 cited

Proportional Representation in Metric Spaces and Low-Distortion Committee Selection

Yusuf Hakan Kalayci, David Kempe, Vikram Kher

We introduce a novel definition for a small set R of k points being "representative" of a larger set in a metric space. Given a set V (e.g., documents or voters) to represent, and…

cs.GT2022

Fine-Grained Buy-Many Mechanisms Are Not Much Better Than Bundling

Sepehr Assadi, Vikram Kher, George Li +1

Multi-item revenue-optimal mechanisms are known to be extremely complex, often offering buyers randomized lotteries of goods. In the standard buy-one model, it is known that optima…

cs.CC2022★ 1 cited

NP-Hardness of a 2D, a 2.5D, and a 3D Puzzle Game

Matthew Ferland, Vikram Kher

In this paper, we give simple NP-hardness reductions for three popular video games. The first is Baba Is You, an award winning 2D block puzzle game with the key premise being the a…