default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbheek Ghosh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Continuous-Time Best-Response and Related Dynamics in Tullock Contests with Convex Costs. CoRR abs/2402.08541 (2024)- [i9]Abheek Ghosh, Alexandros Hollender:
The Complexity of Symmetric Bimatrix Games with Common Payoffs. CoRR abs/2410.08031 (2024) - [i8]Jiarui Gan, Abheek Ghosh, Nicholas Teh:
Persuading a Credible Agent. CoRR abs/2410.23989 (2024) - 2023
- [c9]Abheek Ghosh, Dheeraj Nagaraj, Manish Jain, Milind Tambe:
Indexability is Not Enough for Whittle: Improved, Near-Optimal Algorithms for Restless Bandits. AAMAS 2023: 1294-1302 - [c8]Abheek Ghosh:
Contests and Other Topics in Multi-Agent Systems. AAMAS 2023: 3014-3016 - [c7]Abheek Ghosh
, Paul W. Goldberg:
Best-Response Dynamics in Lottery Contests. EC 2023: 736 - [i7]Abheek Ghosh, Paul W. Goldberg:
Best-Response Dynamics in Lottery Contests. CoRR abs/2305.10881 (2023) - [i6]Abheek Ghosh:
Best-Response Dynamics in Tullock Contests with Convex Costs. CoRR abs/2310.03528 (2023) - 2022
- [c6]Edith Elkind, Abheek Ghosh, Paul Goldberg:
Complexity of Deliberative Coalition Formation. AAAI 2022: 4975-4982 - [c5]Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Contests to Incentivize a Target Group. IJCAI 2022: 279-285 - [c4]Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy. SAGT 2022: 133-150 - [i5]Edith Elkind, Abheek Ghosh, Paul Goldberg:
Complexity of Deliberative Coalition Formation. CoRR abs/2202.12594 (2022) - [i4]Edith Elkind, Abheek Ghosh, Paul Goldberg:
Contests to Incentivize a Target Group. CoRR abs/2204.14051 (2022) - [i3]Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy. CoRR abs/2207.08151 (2022) - [i2]Abheek Ghosh, Dheeraj Nagaraj, Manish Jain, Milind Tambe:
Indexability is Not Enough for Whittle: Improved, Near-Optimal Algorithms for Restless Bandits. CoRR abs/2211.00112 (2022) - 2021
- [c3]Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Contest Design with Threshold Objectives. WINE 2021: 554 - [i1]Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Contest Design with Threshold Objectives. CoRR abs/2109.03179 (2021)
2010 – 2019
- 2018
- [c2]Umang Bhaskar, Varsha Dani, Abheek Ghosh:
Truthful and Near-Optimal Mechanisms for Welfare Maximization in Multi-Winner Elections. AAAI 2018: 925-932 - [c1]Umang Bhaskar, Abheek Ghosh:
On the Welfare of Cardinal Voting Mechanisms. FSTTCS 2018: 27:1-27:22
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 13:08 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:
