default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShivika Narang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Ioannis Caragiannis, Shivika Narang
:
Repeatedly matching items to agents fairly and efficiently. Theor. Comput. Sci. 981: 114246 (2024)- [c8]Salil Gokhale, Samarth Singla, Shivika Narang, Rohit Vaish:
Capacity Modification in the Stable Matching Problem. AAMAS 2024: 697-705 - [c7]Siddharth Barman, Anand Krishna, Pooja Kulkarni, Shivika Narang:
Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. ITCS 2024: 8:1-8:23 - [i8]Salil Gokhale, Shivika Narang, Samarth Singla, Rohit Vaish:
Capacity Modification in the Stable Matching Problem. CoRR abs/2402.04645 (2024) - 2023
- [c6]Ioannis Caragiannis, Shivika Narang:
Repeatedly Matching Items to Agents Fairly and Efficiently. AAMAS 2023: 2670-2672 - [c5]Ioannis Caragiannis, Shivika Narang:
Repeatedly Matching Items to Agents Fairly and Efficiently. SAGT 2023: 347-364 - [i7]Hadi Hosseini, Shivika Narang, Tomasz Was:
Fair Distribution of Delivery Orders. CoRR abs/2305.00040 (2023) - 2022
- [c4]Shivika Narang, Arpita Biswas, Yadati Narahari:
On Achieving Leximin Fairness and Stability in Many-to-One Matchings. AAMAS 2022: 1705-1707 - [i6]Ioannis Caragiannis, Shivika Narang:
Repeatedly Matching Items to Agents Fairly and Efficiently. CoRR abs/2207.01589 (2022) - 2021
- [i5]Siddharth Barman, Anand Krishna, Pooja Kulkarni, Shivika Narang:
Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. CoRR abs/2110.00767 (2021) - 2020
- [c3]Shivika Narang, Yadati Narahari:
A Study of Incentive Compatibility and Stability Issues in Fractional Matchings. AAMAS 2020: 1951-1953 - [i4]Shivika Narang, Y. Narahari:
A Study of Incentive Compatibility and Stability Issues in Fractional Matchings. CoRR abs/2001.05652 (2020) - [i3]Shivika Narang:
Design of Trusted Market Platforms using Permissioned Blockchains and Game Theory. CoRR abs/2001.05655 (2020) - [i2]Shivika Narang, Arpita Biswas, Y. Narahari:
On Achieving Fairness and Stability in Many-to-One Matchings. CoRR abs/2009.05823 (2020)
2010 – 2019
- 2019
- [c2]Siddharth Barman, Ganesh Ghalme, Shweta Jain, Pooja Kulkarni, Shivika Narang:
Fair Division of Indivisible Goods Among Strategic Agents. AAMAS 2019: 1811-1813 - [c1]Shivika Narang, Megha Byali, Pankaj Dayama, Vinayaka Pandit, Y. Narahari:
Design of Trusted B2B Market Platforms using Permissioned Blockchains and Game Theory. IEEE ICBC 2019: 385-393 - [i1]Siddharth Barman, Ganesh Ghalme, Shweta Jain, Pooja Kulkarni, Shivika Narang:
Fair Division of Indivisible Goods Among Strategic Agents. CoRR abs/1901.09427 (2019)
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-05-05 00:12 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:
