Complexity of Manipulation in Elections with Partial Votes. - Vijay Menon 001; Kate Larson (CoRR, 2015)

Reinstating Combinatorial Protections for Manipulation and Bribery in Single-Peaked and Nearly Single-Peaked Electorates. - Vijay Menon 001; Kate Larson (AAAI, 2016)

Deterministic, Strategyproof, and Fair Cake Cutting. - Vijay Menon 001; Kate Larson (IJCAI, 2017)

Computational aspects of strategic behaviour in elections with top-truncated ballots. - Vijay Menon 001; Kate Larson (Auton. Agents Multi Agent Syst., 2017)

Robust and Approximately Stable Marriages Under Partial Information. - Vijay Menon 001; Kate Larson (WINE, 2018)

Mechanism Design for Locating a Facility Under Partial Information. - Vijay Menon 001; Kate Larson (SAGT, 2019)

Learning Desirable Matchings From Partial Preferences. - Hadi Hosseini; Vijay Menon 001; Nisarg Shah 001; Sujoy Sikdar (CoRR, 2020)

Algorithmic Stability in Fair Allocation of Indivisible Goods Among Two Agents. - Vijay Menon 001; Kate Larson (CoRR, 2020)

Improving Welfare in One-sided Matching using Simple Threshold Queries. - Thomas Ma; Vijay Menon 001; Kate Larson (CoRR, 2020)

Necessarily Optimal One-Sided Matchings. - Hadi Hosseini; Vijay Menon 001; Nisarg Shah 001; Sujoy Sikdar (AAAI, 2021)

Improving Welfare in One-Sided Matchings using Simple Threshold Queries. - Thomas Ma; Vijay Menon 001; Kate Larson (IJCAI, 2021)

Making Decisions with Incomplete and Inaccurate Information. - Vijay Menon 001 (2021)