Rohit Vaish

Orcid: 0000-0002-4417-3718

According to our database1, Rohit Vaish authored at least 36 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Graphical house allocation with identical valuations.
Auton. Agents Multi Agent Syst., December, 2024

Best of Both Worlds: Ex Ante and Ex Post Fairness in Resource Allocation.
Oper. Res., 2024

Fair and Efficient Completion of Indivisible Goods.
CoRR, 2024

Fair Interval Scheduling of Indivisible Chores.
CoRR, 2024

Fair Scheduling of Indivisible Chores.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Tight Approximations for Graphical House Allocation.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Capacity Modification in the Stable Matching Problem.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Charging Electric Vehicles Fairly and Efficiently.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Maximizing Nash Social Welfare under Two-Sided Preferences.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Towards Fair Allocation in Social Commerce Platforms.
Proceedings of the ACM Web Conference 2023, 2023

The Price of Equity with Binary Valuations and Few Agent Types.
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Semi-Popular Matchings and Copeland Winners.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Fairly Dividing Mixtures of Goods and Chores under Lexicographic Preferences.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Graphical House Allocation.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Hide, Not Seek: Perceived Fairness in Envy-Free Allocations of Indivisible Goods.
CoRR, 2022

Two for One & One for All: Two-Sided Manipulation in Matching Markets.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Matchings and Copeland's Method.
CoRR, 2021

Equitable Division of a Path.
CoRR, 2021

Stable fractional matchings.
Artif. Intell., 2021

Accomplice Manipulation of the Deferred Acceptance Algorithm.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources.
Proceedings of the Approximation, 2021

Fair and Efficient Allocations under Lexicographic Preferences.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Representative Proxy Voting.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Equitable Allocations of Indivisible Chores.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Fair Division Through Information Withholding.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Fair Division through Information Withholding.
CoRR, 2019

Equitable Allocations of Indivisible Goods.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Minimizing Time-to-Rank: A Learning and Recommendation Approach.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
Finding Fair and Efficient Allocations.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Greedy Algorithms for Maximizing Nash Social Welfare.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Analysis of Thompson Sampling for Stochastic Sleeping Bandits.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Opting Into Optimal Matchings.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Manipulating Gale-Shapley Algorithm: Preserving Stability and Remaining Inconspicuous.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
On the Computational Hardness of Manipulating Pairwise Voting Rules.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2014
On the Statistical Consistency of Plug-in Classifiers for Non-decomposable Performance Measures.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014


  Loading...