default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 137 matches
- 2024
- Siddharth Barman, Umang Bhaskar, Yeshwant Pandit, Soumyajit Pyne:
Nearly Equitable Allocations beyond Additivity and Monotonicity. AAAI 2024: 9494-9501 - Siddharth Barman, Debajyoti Kar, Shraddha Pathak:
Parameterized Guarantees for Almost Envy-Free Allocations. AAMAS 2024: 151-159 - Siddharth Barman, Anand Krishna, Pooja Kulkarni, Shivika Narang:
Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. ITCS 2024: 8:1-8:23 - Ayush Sawarni, Nirjhar Das, Siddharth Barman, Gaurav Sinha:
Optimal Regret with Limited Adaptivity for Generalized Linear Contextual Bandits. CoRR abs/2404.06831 (2024) - Rahul Madhavan, Aurghya Maiti, Gaurav Sinha, Siddharth Barman:
Causal Contextual Bandits with Adaptive Context. CoRR abs/2405.18626 (2024) - Siddharth Barman, Mashbat Suzuki:
Compatibility of Fairness and Nash Welfare under Subadditive Valuations. CoRR abs/2407.12461 (2024) - 2023
- Md. Rahat Hasan, Ammar Alazab, Siddhartha Barman Joy, Mohammed Nasir Uddin, Md. Ashraf Uddin, Ansam Khraisat, Iqbal Gondal, Wahida Ferdose Urmi, Md. Alamin Talukder:
Smart Contract-Based Access Control Framework for Internet of Things Devices. Comput. 12(11): 240 (2023) - Siddharth Barman, Federico Echenique:
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. Math. Oper. Res. 48(1): 313-331 (2023) - Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni:
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. AAAI 2023: 6762-6769 - Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas:
Finding Fair Allocations under Budget Constraints. AAAI 2023: 5481-5489 - Siddharth Barman, Vishnu V. Narayan, Paritosh Verma:
Fair Chore Division under Binary Supermodular Costs. AAMAS 2023: 2863-2865 - Siddharth Barman, Pooja Kulkarni:
Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. ICALP 2023: 16:1-16:19 - Ayush Sawarni, Soumyabrata Pal, Siddharth Barman:
Nash Regret Guarantees for Linear Bandits. NeurIPS 2023 - Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas:
Guaranteeing Envy-Freeness under Generalized Assignment Constraints. EC 2023: 242-269 - Ayush Sawarni, Rahul Madhavan, Gaurav Sinha, Siddharth Barman:
Learning good interventions in causal graphs via covering. UAI 2023: 1827-1836 - Siddharth Barman, Vishnu V. Narayan, Paritosh Verma:
Fair Chore Division under Binary Supermodular Costs. CoRR abs/2302.11530 (2023) - Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas:
Guaranteeing Envy-Freeness under Generalized Assignment Constraints. CoRR abs/2305.01339 (2023) - Ayush Sawarni, Rahul Madhavan, Gaurav Sinha, Siddharth Barman:
Learning Good Interventions in Causal Graphs via Covering. CoRR abs/2305.04638 (2023) - Ayush Sawarni, Soumybrata Pal, Siddharth Barman:
Nash Regret Guarantees for Linear Bandits. CoRR abs/2310.02023 (2023) - Siddharth Barman, Umang Bhaskar, Yeshwant Pandit, Soumyajit Pyne:
Nearly Equitable Allocations Beyond Additivity and Monotonicity. CoRR abs/2312.07195 (2023) - Siddharth Barman, Debajyoti Kar, Shraddha Pathak:
Parameterized Guarantees for Almost Envy-Free Allocations. CoRR abs/2312.13791 (2023) - 2022
- Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fully Polynomial-Time Approximation Schemes for Fair Rent Division. Math. Oper. Res. 47(3): 1970-1998 (2022) - Siddharth Barman, Nidhi Rathi:
Fair Cake Division Under Monotone Likelihood Ratios. Math. Oper. Res. 47(3): 1875-1903 (2022) - Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar:
Tight approximation bounds for maximum multi-coverage. Math. Program. 192(1): 443-476 (2022) - Siddharth Barman, Arindam Khan, Arnab Maiti:
Universal and Tight Online Algorithms for Generalized-Mean Welfare. AAAI 2022: 4793-4800 - Siddharth Barman, Paritosh Verma:
Truthful and Fair Mechanisms for Matroid-Rank Valuations. AAAI 2022: 4801-4808 - Siddharth Barman, Anand Krishna, Yadati Narahari, Soumyarup Sadhukhan:
Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations. IJCAI 2022: 60-66 - Siddharth Barman, Anand Krishna, Y. Narahari, Soumyarup Sadhukhan:
Nash Welfare Guarantees for Fair and Efficient Coverage. WINE 2022: 256-272 - Siddharth Barman, Anand Krishna, Y. Narahari, Soumyarup Sadhukhan:
Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations. CoRR abs/2201.07419 (2022) - Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni:
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. CoRR abs/2205.13930 (2022)
skipping 107 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-06 13:45 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint