default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRohit Vaish
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]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): 42 (2024)- [c28]Pallavi Jain, Rohit Vaish:
Maximizing Nash Social Welfare under Two-Sided Preferences. AAAI 2024: 9798-9806 - [c27]Salil Gokhale, Samarth Singla, Shivika Narang, Rohit Vaish:
Capacity Modification in the Stable Matching Problem. AAMAS 2024: 697-705 - [c26]Hadi Hosseini, Andrew McGregor, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan:
Tight Approximations for Graphical House Allocation. AAMAS 2024: 825-833 - [c25]Ramsundar Anandanarayanan, Swaprava Nath, Rohit Vaish:
Charging Electric Vehicles Fairly and Efficiently. AAMAS 2024: 2126-2128 - [c24]Yatharth Kumar, Sarfaraz Equbal, Rohit Gurjar, Swaprava Nath, Rohit Vaish:
Fair Scheduling of Indivisible Chores. AAMAS 2024: 2345-2347 - [i26]Sarfaraz Equbal, Rohit Gurjar, Yatharth Kumar, Swaprava Nath, Rohit Vaish:
Fair Interval Scheduling of Indivisible Chores. CoRR abs/2402.04353 (2024) - [i25]Salil Gokhale, Shivika Narang, Samarth Singla, Rohit Vaish:
Capacity Modification in the Stable Matching Problem. CoRR abs/2402.04645 (2024) - [i24]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 abs/2402.12759 (2024) - [i23]Vishwa Prakash H. V., Ayumi Igarashi, Rohit Vaish:
Fair and Efficient Completion of Indivisible Goods. CoRR abs/2406.09468 (2024) - 2023
- [c23]Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Lirong Xia:
Fairly Dividing Mixtures of Goods and Chores under Lexicographic Preferences. AAMAS 2023: 152-160 - [c22]Hadi Hosseini, Justin Payan, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan:
Graphical House Allocation. AAMAS 2023: 161-169 - [c21]Telikepalli Kavitha, Rohit Vaish:
Semi-Popular Matchings and Copeland Winners. AAMAS 2023: 957-965 - [c20]Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish:
The Price of Equity with Binary Valuations and Few Agent Types. SAGT 2023: 271-289 - [c19]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: 3744-3754 - [i22]Hadi Hosseini, Justin Payan, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan:
Graphical House Allocation. CoRR abs/2301.01323 (2023) - [i21]Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish:
The Price of Equity with Binary Valuations and Few Agent Types. CoRR abs/2307.06726 (2023) - [i20]Hadi Hosseini, Andrew McGregor, Rik Sengupta, Rohit Vaish, Vignesh Viswanathan:
Tight Approximations for Graphical House Allocation. CoRR abs/2307.12482 (2023) - [i19]Pallavi Jain, Rohit Vaish:
Maximizing Nash Social Welfare under Two-Sided Preferences. CoRR abs/2312.09167 (2023) - 2022
- [c18]Hadi Hosseini, Fatima Umar, Rohit Vaish:
Two for One & One for All: Two-Sided Manipulation in Matching Markets. IJCAI 2022: 321-327 - [i18]Hadi Hosseini, Fatima Umar, Rohit Vaish:
Two for One & One for All: Two-Sided Manipulation in Matching Markets. CoRR abs/2201.08774 (2022) - [i17]Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Lirong Xia:
Fairly Dividing Mixtures of Goods and Chores under Lexicographic Preferences. CoRR abs/2203.07279 (2022) - [i16]Hadi Hosseini, Joshua Kavner, Sujoy Sikdar, Rohit Vaish, Lirong Xia:
Hide, Not Seek: Perceived Fairness in Envy-Free Allocations of Indivisible Goods. CoRR abs/2212.04574 (2022) - 2021
- [j1]Ioannis Caragiannis, Aris Filos-Ratsikas, Panagiotis Kanellopoulos, Rohit Vaish:
Stable fractional matchings. Artif. Intell. 295: 103416 (2021) - [c17]Elliot Anshelevich, Zack Fitzsimmons, Rohit Vaish, Lirong Xia:
Representative Proxy Voting. AAAI 2021: 5086-5093 - [c16]Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Lirong Xia:
Fair and Efficient Allocations under Lexicographic Preferences. AAAI 2021: 5472-5480 - [c15]Umang Bhaskar, A. R. Sricharan, Rohit Vaish:
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. APPROX-RANDOM 2021: 1:1-1:23 - [c14]Hadi Hosseini, Fatima Umar, Rohit Vaish:
Accomplice Manipulation of the Deferred Acceptance Algorithm. IJCAI 2021: 231-237 - [i15]Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan, Rohit Vaish:
Equitable Division of a Path. CoRR abs/2101.09794 (2021) - [i14]Telikepalli Kavitha, Rohit Vaish:
Matchings and Copeland's Method. CoRR abs/2105.13729 (2021) - 2020
- [c13]Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Hejun Wang, Lirong Xia:
Fair Division Through Information Withholding. AAAI 2020: 2014-2021 - [c12]Rupert Freeman, Sujoy Sikdar, Rohit Vaish, Lirong Xia:
Equitable Allocations of Indivisible Chores. AAMAS 2020: 384-392 - [c11]Rupert Freeman, Nisarg Shah, Rohit Vaish:
Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation. EC 2020: 21-22 - [i13]Rupert Freeman, Sujoy Sikdar, Rohit Vaish, Lirong Xia:
Equitable Allocations of Indivisible Chores. CoRR abs/2002.11504 (2020) - [i12]Rupert Freeman, Nisarg Shah, Rohit Vaish:
Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation. CoRR abs/2005.14122 (2020) - [i11]Hadi Hosseini, Fatima Umar, Rohit Vaish:
Accomplice Manipulation of the Deferred Acceptance Algorithm. CoRR abs/2012.04518 (2020) - [i10]Elliot Anshelevich, Zack Fitzsimmons, Rohit Vaish, Lirong Xia:
Representative Proxy Voting. CoRR abs/2012.06747 (2020) - [i9]Umang Bhaskar, A. R. Sricharan, Rohit Vaish:
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. CoRR abs/2012.06788 (2020) - [i8]Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Lirong Xia:
Fair and Efficient Allocations under Lexicographic Preferences. CoRR abs/2012.07680 (2020)
2010 – 2019
- 2019
- [c10]Ioannis Caragiannis, Aris Filos-Ratsikas, Panagiotis Kanellopoulos, Rohit Vaish:
Stable Fractional Matchings. EC 2019: 21-39 - [c9]Rupert Freeman, Sujoy Sikdar, Rohit Vaish, Lirong Xia:
Equitable Allocations of Indivisible Goods. IJCAI 2019: 280-286 - [c8]Haoming Li, Sujoy Sikdar, Rohit Vaish, Junming Wang, Lirong Xia, Chaonan Ye:
Minimizing Time-to-Rank: A Learning and Recommendation Approach. IJCAI 2019: 1408-1414 - [i7]Ioannis Caragiannis, Aris Filos-Ratsikas, Panagiotis Kanellopoulos, Rohit Vaish:
Stable fractional matchings. CoRR abs/1902.06698 (2019) - [i6]Rupert Freeman, Sujoy Sikdar, Rohit Vaish, Lirong Xia:
Equitable Allocations of Indivisible Goods. CoRR abs/1905.10656 (2019) - [i5]Haoming Li, Sujoy Sikdar, Rohit Vaish, Junming Wang, Lirong Xia, Chaonan Ye:
Minimizing Time-to-Rank: A Learning and Recommendation Approach. CoRR abs/1905.11984 (2019) - [i4]Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Jun Wang, Lirong Xia:
Fair Division through Information Withholding. CoRR abs/1907.02583 (2019) - 2018
- [c7]Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish:
Greedy Algorithms for Maximizing Nash Social Welfare. AAMAS 2018: 7-13 - [c6]Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish:
Finding Fair and Efficient Allocations. EC 2018: 557-574 - [i3]Siddharth Barman, Sanath Kumar Krishna Murthy, Rohit Vaish:
Greedy Algorithms for Maximizing Nash Social Welfare. CoRR abs/1801.09046 (2018) - 2017
- [c5]Rohit Vaish, Dinesh Garg:
Manipulating Gale-Shapley Algorithm: Preserving Stability and Remaining Inconspicuous. IJCAI 2017: 437-443 - [c4]Avrim Blum, Ioannis Caragiannis, Nika Haghtalab, Ariel D. Procaccia, Eviatar B. Procaccia, Rohit Vaish:
Opting Into Optimal Matchings. SODA 2017: 2351-2363 - [c3]Aritra Chatterjee, Ganesh Ghalme, Shweta Jain, Rohit Vaish, Y. Narahari:
Analysis of Thompson Sampling for Stochastic Sleeping Bandits. UAI 2017 - [i2]Siddharth Barman, Sanath Kumar Krishna Murthy, Rohit Vaish:
Finding Fair and Efficient Allocations. CoRR abs/1707.04731 (2017) - 2016
- [c2]Rohit Vaish, Neeldhara Misra, Shivani Agarwal, Avrim Blum:
On the Computational Hardness of Manipulating Pairwise Voting Rules. AAMAS 2016: 358-367 - [i1]Avrim Blum, Ioannis Caragiannis, Nika Haghtalab, Ariel D. Procaccia, Eviatar B. Procaccia, Rohit Vaish:
Opting Into Optimal Matchings. CoRR abs/1609.04051 (2016) - 2014
- [c1]Harikrishna Narasimhan, Rohit Vaish, Shivani Agarwal:
On the Statistical Consistency of Plug-in Classifiers for Non-decomposable Performance Measures. NIPS 2014: 1493-1501
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
