default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParitosh Verma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Vasilis Gkatzelis, Alexandros Psomas, Xizhi Tan, Paritosh Verma:
Getting More by Knowing Less: Bayesian Incentive Compatible Mechanisms for Fair Division. IJCAI 2024: 2807-2815- [c11]Marios Mertzanidis
, Alexandros Psomas, Paritosh Verma:
Automating Food Drop: The Power of Two Choices for Dynamic and Fair Food Allocation. EC 2024: 243 - [c10]Owen Eckart, Alexandros Psomas, Paritosh Verma:
On the Fairness of Normalized $p$-Means for Allocating Goods and Chores. EC 2024: 1267 - [c9]Gerdus Benade, Daniel Halpern, Alexandros Psomas, Paritosh Verma:
On the Existence of Envy-Free Allocations Beyond Additive Valuations. EC 2024: 1287 - [i12]Owen Eckart, Alexandros Psomas, Paritosh Verma:
On the Fairness of Normalized p-Means for Allocating Goods and Chores. CoRR abs/2402.14996 (2024) - [i11]Marios Mertzanidis, Christos-Alexandros Psomas, Paritosh Verma:
Automating Food Drop: The Power of Two Choices for Dynamic and Fair Food Allocation. CoRR abs/2406.06363 (2024) - 2023
- [j1]Shresth Verma, Gargi Singh, Aditya Mate, Paritosh Verma, Sruthi Gorantla, Neha Madhiwalla, Aparna Hegde, Divy Thakkar, Manish Jain, Milind Tambe, Aparna Taneja:
Expanding impact of mobile health programs: SAHELI for maternal and child care. AI Mag. 44(4): 363-376 (2023) - [c8]Shresth Verma, Gargi Singh, Aditya Mate, Paritosh Verma, Sruthi Gorantla, Neha Madhiwalla, Aparna Hegde, Divy Thakkar, Manish Jain, Milind Tambe, Aparna Taneja:
Increasing Impact of Mobile Health Programs: SAHELI for Maternal and Child Care. AAAI 2023: 15594-15602 - [c7]Siddharth Barman, Vishnu V. Narayan, Paritosh Verma:
Fair Chore Division under Binary Supermodular Costs. AAMAS 2023: 2863-2865 - [c6]Christos Boutsikas, Petros Drineas, Marios Mertzanidis, Alexandros Psomas, Paritosh Verma:
Refined Mechanism Design for Approximately Structured Priors via Active Regression. NeurIPS 2023 - [i10]Paritosh Verma, Shresth Verma, Aditya Mate, Aparna Taneja, Milind Tambe:
Decision-Focused Evaluation: Analyzing Performance of Deployed Restless Multi-Arm Bandits. CoRR abs/2301.07835 (2023) - [i9]Siddharth Barman, Vishnu V. Narayan, Paritosh Verma:
Fair Chore Division under Binary Supermodular Costs. CoRR abs/2302.11530 (2023) - [i8]Vasilis Gkatzelis, Alexandros Psomas, Xizhi Tan, Paritosh Verma:
Getting More by Knowing Less: Bayesian Incentive Compatible Mechanisms for Fair Division. CoRR abs/2306.02040 (2023) - [i7]Gerdus Benadè, Daniel Halpern, Alexandros Psomas, Paritosh Verma:
On the Existence of Envy-Free Allocations Beyond Additive Valuations. CoRR abs/2307.09648 (2023) - [i6]Christos Boutsikas, Petros Drineas, Marios Mertzanidis, Alexandros Psomas, Paritosh Verma:
Refined Mechanism Design for Approximately Structured Priors via Active Regression. CoRR abs/2310.07874 (2023) - 2022
- [c5]Siddharth Barman, Paritosh Verma:
Truthful and Fair Mechanisms for Matroid-Rank Valuations. AAAI 2022: 4801-4808 - [c4]Alexandros Psomas, Paritosh Verma:
Fair and Efficient Allocations Without Obvious Manipulations. NeurIPS 2022 - [i5]Alexandros Psomas, Paritosh Verma:
Fair and Efficient Allocations Without Obvious Manipulations. CoRR abs/2206.11143 (2022) - 2021
- [c3]Siddharth Barman, Paritosh Verma:
Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations. AAMAS 2021: 169-177 - [c2]Siddharth Barman, Paritosh Verma:
Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations. WINE 2021: 373-390 - [i4]Siddharth Barman, Paritosh Verma:
Approximating Nash Social Welfare under Binary XOS and Binary Subadditive Valuations. CoRR abs/2106.02656 (2021) - [i3]Siddharth Barman, Paritosh Verma:
Truthful and Fair Mechanisms for Matroid-Rank Valuations. CoRR abs/2109.05810 (2021) - 2020
- [i2]Paritosh Verma:
Space Lower Bounds for Graph Stream Problems. CoRR abs/2011.10528 (2020) - [i1]Siddharth Barman, Paritosh Verma:
Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations. CoRR abs/2012.12710 (2020)
2010 – 2019
- 2019
- [c1]Paritosh Verma:
Space Lower Bounds for Graph Stream Problems. TAMC 2019: 635-646
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 2025-01-09 12:47 CET 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:
