Rohit Vaish

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 55

Top Topics

Resource Allocation

Greedy Algorithm

Top Venues

Publications

Hadi Hosseini, Andrew McGregor, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan
Tight Approximations for Graphical House Allocation. AAMAS (2024)
Hadi Hosseini, Andrew McGregor, Justin Payan, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan
Graphical house allocation with identical valuations. Auton. Agents Multi Agent Syst. 38 (2) (2024)
Anjali Gupta, Shreyans J. Nagori, Abhijnan Chakraborty, Rohit Vaish, Sayan Ranu, Prajit Prashant Sinai Nadkarni, Narendra Varma Dasararaju, Muthusamy Chelliah
Towards Fair Allocation in Social Commerce Platforms. CoRR (2024)
Pallavi Jain, Rohit Vaish
Maximizing Nash Social Welfare under Two-Sided Preferences. AAAI (2024)
Salil Gokhale, Shivika Narang, Samarth Singla, Rohit Vaish
Capacity Modification in the Stable Matching Problem. CoRR (2024)
Vishwa Prakash H. V., Ayumi Igarashi, Rohit Vaish
Fair and Efficient Completion of Indivisible Goods. CoRR (2024)
Salil Gokhale, Samarth Singla, Shivika Narang, Rohit Vaish
Capacity Modification in the Stable Matching Problem. AAMAS (2024)
Sarfaraz Equbal, Rohit Gurjar, Yatharth Kumar, Swaprava Nath, Rohit Vaish
Fair Interval Scheduling of Indivisible Chores. CoRR (2024)
Yatharth Kumar, Sarfaraz Equbal, Rohit Gurjar, Swaprava Nath, Rohit Vaish
Fair Scheduling of Indivisible Chores. AAMAS (2024)
Ramsundar Anandanarayanan, Swaprava Nath, Rohit Vaish
Charging Electric Vehicles Fairly and Efficiently. AAMAS (2024)
Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish
The Price of Equity with Binary Valuations and Few Agent Types. CoRR (2023)
Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Lirong Xia
Fairly Dividing Mixtures of Goods and Chores under Lexicographic Preferences. AAMAS (2023)
Anjali Gupta, Shreyans J. Nagori, Abhijnan Chakraborty, Rohit Vaish, Sayan Ranu, Prajit Prashant Sinai Nadkarni, Narendra Varma Dasararaju, Muthusamy Chelliah
Towards Fair Allocation in Social Commerce Platforms. WWW (2023)
Telikepalli Kavitha, Rohit Vaish
Semi-Popular Matchings and Copeland Winners. AAMAS (2023)
Hadi Hosseini, Justin Payan, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan
Graphical House Allocation. CoRR (2023)
Pallavi Jain, Rohit Vaish
Maximizing Nash Social Welfare under Two-Sided Preferences. CoRR (2023)
Hadi Hosseini, Justin Payan, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan
Graphical House Allocation. AAMAS (2023)
Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish
The Price of Equity with Binary Valuations and Few Agent Types. SAGT (2023)
Hadi Hosseini, Andrew McGregor, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan
Tight Approximations for Graphical House Allocation. CoRR (2023)
Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Lirong Xia
Fairly Dividing Mixtures of Goods and Chores under Lexicographic Preferences. CoRR (2022)
Hadi Hosseini, Joshua Kavner, Sujoy Sikdar, Rohit Vaish, Lirong Xia
Hide, Not Seek: Perceived Fairness in Envy-Free Allocations of Indivisible Goods. CoRR (2022)
Hadi Hosseini, Fatima Umar, Rohit Vaish
Two for One & One for All: Two-Sided Manipulation in Matching Markets. IJCAI (2022)
Hadi Hosseini, Fatima Umar, Rohit Vaish
Two for One & One for All: Two-Sided Manipulation in Matching Markets. CoRR (2022)
Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Lirong Xia
Fair and Efficient Allocations under Lexicographic Preferences. AAAI (2021)
Telikepalli Kavitha, Rohit Vaish
Matchings and Copeland's Method. CoRR (2021)
Elliot Anshelevich, Zack Fitzsimmons, Rohit Vaish, Lirong Xia
Representative Proxy Voting. AAAI (2021)
Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan, Rohit Vaish
Equitable Division of a Path. CoRR (2021)
Umang Bhaskar, A. R. Sricharan, Rohit Vaish
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. APPROX-RANDOM (2021)
Ioannis Caragiannis, Aris Filos-Ratsikas, Panagiotis Kanellopoulos, Rohit Vaish
Stable fractional matchings. Artif. Intell. 295 (2021)
Hadi Hosseini, Fatima Umar, Rohit Vaish
Accomplice Manipulation of the Deferred Acceptance Algorithm. IJCAI (2021)
Rupert Freeman, Sujoy Sikdar, Rohit Vaish, Lirong Xia
Equitable Allocations of Indivisible Chores. AAMAS (2020)
Umang Bhaskar, A. R. Sricharan, Rohit Vaish
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. CoRR (2020)
Hadi Hosseini, Fatima Umar, Rohit Vaish
Accomplice Manipulation of the Deferred Acceptance Algorithm. CoRR (2020)
Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Hejun Wang, Lirong Xia
Fair Division Through Information Withholding. AAAI (2020)
Rupert Freeman, Nisarg Shah, Rohit Vaish
Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation. EC (2020)
Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Lirong Xia
Fair and Efficient Allocations under Lexicographic Preferences. CoRR (2020)
Rupert Freeman, Nisarg Shah, Rohit Vaish
Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation. CoRR (2020)
Rupert Freeman, Sujoy Sikdar, Rohit Vaish, Lirong Xia
Equitable Allocations of Indivisible Chores. CoRR (2020)
Elliot Anshelevich, Zack Fitzsimmons, Rohit Vaish, Lirong Xia
Representative Proxy Voting. CoRR (2020)
Ioannis Caragiannis, Aris Filos-Ratsikas, Panagiotis Kanellopoulos, Rohit Vaish
Stable fractional matchings. CoRR (2019)
Haoming Li, Sujoy Sikdar, Rohit Vaish, Junming Wang, Lirong Xia, Chaonan Ye
Minimizing Time-to-Rank: A Learning and Recommendation Approach. IJCAI (2019)
Ioannis Caragiannis, Aris Filos-Ratsikas, Panagiotis Kanellopoulos, Rohit Vaish
Stable Fractional Matchings. EC (2019)
Haoming Li, Sujoy Sikdar, Rohit Vaish, Junming Wang, Lirong Xia, Chaonan Ye
Minimizing Time-to-Rank: A Learning and Recommendation Approach. CoRR (2019)
Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Jun Wang, Lirong Xia
Fair Division through Information Withholding. CoRR (2019)
Rupert Freeman, Sujoy Sikdar, Rohit Vaish, Lirong Xia
Equitable Allocations of Indivisible Goods. IJCAI (2019)
Rupert Freeman, Sujoy Sikdar, Rohit Vaish, Lirong Xia
Equitable Allocations of Indivisible Goods. CoRR (2019)
Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish
Finding Fair and Efficient Allocations. EC (2018)
Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish
Greedy Algorithms for Maximizing Nash Social Welfare. AAMAS (2018)
Siddharth Barman, Sanath Kumar Krishna Murthy, Rohit Vaish
Greedy Algorithms for Maximizing Nash Social Welfare. CoRR (2018)
Siddharth Barman, Sanath Kumar Krishna Murthy, Rohit Vaish
Finding Fair and Efficient Allocations. CoRR (2017)
Aritra Chatterjee, Ganesh Ghalme, Shweta Jain, Rohit Vaish, Y. Narahari
Analysis of Thompson Sampling for Stochastic Sleeping Bandits. UAI (2017)
Rohit Vaish, Dinesh Garg
Manipulating Gale-Shapley Algorithm: Preserving Stability and Remaining Inconspicuous. IJCAI (2017)
Avrim Blum, Ioannis Caragiannis, Nika Haghtalab, Ariel D. Procaccia, Eviatar B. Procaccia, Rohit Vaish
Opting Into Optimal Matchings. SODA (2017)
Avrim Blum, Ioannis Caragiannis, Nika Haghtalab, Ariel D. Procaccia, Eviatar B. Procaccia, Rohit Vaish
Opting Into Optimal Matchings. CoRR (2016)
Rohit Vaish, Neeldhara Misra, Shivani Agarwal, Avrim Blum
On the Computational Hardness of Manipulating Pairwise Voting Rules. AAMAS (2016)
Harikrishna Narasimhan, Rohit Vaish, Shivani Agarwal
On the Statistical Consistency of Plug-in Classifiers for Non-decomposable Performance Measures. NIPS (2014)