◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Vikram Kher

5 papers hereh-index 298 citations6 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author1
  • last author2

Across the 5 of 5 papers where every author was matched, so the position is known.

fields
  • cs.GT2
  • cs.CC1
  • cs.LG1
  • stat.ML1

identity via Semantic Scholar / OpenAlex

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
Showing 2022Show all

2 papers · 1 filter

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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.