◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Y. Narahari

38 papers hereh-index 283.5k citations258 works total

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

author position
  • middle author5
  • last author32

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

fields
  • cs.GT24
  • cs.LG5
  • cs.AI3
  • cs.MA2
  • cs.SI2
  • cs.CY1
same name
  • Y. Narahari — 18 papers, h 15
  • Y. Narahari — 1 paper, h 0
  • Y. Narahari — 1 paper, h 0

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20082025
most citedInformation Diffusion in Social Networks in Two Phases

31 citations · 144 across the 37 of their papers we have counts for

collaborators
Showing 2014Show all

4 papers · 1 filter

cs.GT2014★ 4 cited

An Incentive Compatible Multi-Armed-Bandit Crowdsourcing Mechanism with Quality Assurance

Shweta Jain, Sujit Gujar, Satyanath Bhat +2

Consider a requester who wishes to crowdsource a series of identical binary labeling tasks to a pool of workers so as to achieve an assured accuracy for each task, in a cost optima…

cs.GT2014

Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting

Palash Dey, Neeldhara Misra, Y. Narahari

In the Possible Winner problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made…

cs.MA2014

Detecting Possible Manipulators in Elections

Palash Dey, Neeldhara Misra, Y. Narahari

Manipulation is a problem of fundamental importance in the context of voting in which the voters exercise their votes strategically instead of voting honestly to prevent selection…

cs.GT2014★ 10 cited

Redistribution Mechanisms for Assignment of Heterogeneous Objects

Sujit Gujar, Yadati Narahari

There are p heterogeneous objects to be assigned to n competing agents (n > p) each with unit demand. It is required to design a Groves mechanism for this assignment problem satisf…

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