default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAniket Murhekar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Jugal Garg, Aniket Murhekar:
Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods. J. Artif. Intell. Res. 80: 1-25 (2024)- [c17]Bhaskar Ray Chaudhury, Aniket Murhekar, Zhuowen Yuan, Bo Li, Ruta Mehta, Ariel D. Procaccia:
Fair Federated Learning via the Proportional Veto Core. ICML 2024 - [c16]Jugal Garg, Aniket Murhekar, John Qin:
Weighted EF1 and PO Allocations with Few Types of Agents or Chores. IJCAI 2024: 2799-2806 - [c15]Aniket Murhekar:
Fair and Efficient Chore Allocation: Existence and Computation. IJCAI 2024: 8500-8501 - [i11]Jugal Garg, Aniket Murhekar, John Qin:
Weighted EF1 and PO Allocations with Few Types of Agents or Chores. CoRR abs/2402.17173 (2024) - [i10]Jugal Garg, Aniket Murhekar, John Qin:
Fair Division of Indivisible Chores via Earning Restricted Equilibria. CoRR abs/2407.03318 (2024) - 2023
- [j1]Jugal Garg, Aniket Murhekar
:
Computing fair and efficient allocations with few utility values. Theor. Comput. Sci. 962: 113932 (2023) - [c14]Aniket Murhekar, Eklavya Sharma:
Nash Equilibria of Two-Player Matrix Games Repeated Until Collision. FSTTCS 2023: 18:1-18:17 - [c13]Jugal Garg, Aniket Murhekar, John Qin:
New Algorithms for the Fair and Efficient Allocation of Indivisible Chores. IJCAI 2023: 2710-2718 - [c12]Aniket Murhekar, Zhuowen Yuan, Bhaskar Ray Chaudhury, Bo Li, Ruta Mehta:
Incentives in Federated Learning: Equilibria, Dynamics, and Mechanisms for Welfare Maximization. NeurIPS 2023 - [c11]Aniket Murhekar, David Arbour, Tung Mai, Anup B. Rao:
Brief Announcement: Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud. SPAA 2023: 307-310 - [i9]Aniket Murhekar, David Arbour, Tung Mai, Anup Rao:
Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud. CoRR abs/2304.08648 (2023) - [i8]Aniket Murhekar, Eklavya Sharma:
Nash Equilibria of Two-Player Matrix Games Repeated Until Collision. CoRR abs/2309.15870 (2023) - 2022
- [c10]Jugal Garg, Aniket Murhekar, John Qin:
Fair and Efficient Allocations of Chores under Bivalued Preferences. AAAI 2022: 5043-5050 - [c9]Vasilis Livanos, Ruta Mehta, Aniket Murhekar:
(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna. AAMAS 2022: 1678-1680 - [c8]Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh:
Tractable Fragments of the Maximum Nash Welfare Problem. WINE 2022: 362-363 - [i7]Vasilis Livanos, Ruta Mehta, Aniket Murhekar:
(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna. CoRR abs/2202.02672 (2022) - [i6]Jugal Garg, Aniket Murhekar:
Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods. CoRR abs/2204.14229 (2022) - [i5]Jugal Garg, Aniket Murhekar, John Qin:
Improving Fairness and Efficiency Guarantees for Allocating Indivisible Chores. CoRR abs/2212.02440 (2022) - 2021
- [c7]Aniket Murhekar, Jugal Garg:
On Fair and Efficient Allocations of Indivisible Goods. AAAI 2021: 5595-5602 - [c6]Jugal Garg, Pooja Kulkarni, Aniket Murhekar:
On Fair and Efficient Allocations of Indivisible Public Goods. FSTTCS 2021: 22:1-22:19 - [c5]Jugal Garg, Aniket Murhekar:
Computing Fair and Efficient Allocations with Few Utility Values. SAGT 2021: 345-359 - [i4]Jugal Garg, Pooja Kulkarni, Aniket Murhekar:
On Fair and Efficient Allocations of Indivisible Public Goods. CoRR abs/2107.09871 (2021) - [i3]Jugal Garg, Aniket Murhekar, John Qin:
Fair and Efficient Allocations of Chores under Bivalued Preferences. CoRR abs/2110.09601 (2021) - [i2]Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh:
Tractable Fragments of the Maximum Nash Welfare Problem. CoRR abs/2112.10199 (2021) - 2020
- [c4]Aniket Murhekar, Ruta Mehta:
Approximate Nash Equilibria of Imitation Games: Algorithms and Complexity. AAMAS 2020: 887-894 - [c3]S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas:
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. STACS 2020: 37:1-37:18
2010 – 2019
- 2018
- [c2]Kundan Krishna, Aniket Murhekar, Saumitra Sharma, Balaji Vasan Srinivasan:
Vocabulary Tailored Summary Generation. COLING 2018: 795-805 - 2017
- [c1]Krishnendu Chatterjee, Hongfei Fu, Aniket Murhekar:
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds. CAV (1) 2017: 118-139 - [i1]Krishnendu Chatterjee, Hongfei Fu, Aniket Murhekar:
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds. CoRR abs/1705.00314 (2017)
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-10-21 20:33 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:
