Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

On the Computational Hardness of Manipulating Pairwise Voting Rules

Identifier:nobleid.org/w1/20260515/C71B3C35

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/C71B3C35.svg?ark=w1%2F20260515%2FC71B3C35)](https://nobleid.org/work/w1/20260515/C71B3C35)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Neeldhara Misra

Shivani Agarwal

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy

On the Computational Hardness of Manipulating Pairwise Voting Rules | NobleID