Aniket Murhekar

About Aniket Murhekar

Aniket Murhekar, With an exceptional h-index of 8 and a recent h-index of 8 (since 2020), a distinguished researcher at University of Illinois at Urbana-Champaign, specializes in the field of Fair Division, Algorithmic Game Theory, Theoretical Computer Science.

His recent articles reflect a diverse array of research interests and contributions to the field:

Weighted EF1 and PO Allocations with Few Types of Agents or Chores

Incentives in federated learning: Equilibria, dynamics, and mechanisms for welfare maximization

Nash Equilibria of Two-Player Matrix Games Repeated Until Collision

Computing fair and efficient allocations with few utility values

Brief announcement: Dynamic vector bin packing for online resource allocation in the cloud

Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud

New algorithms for the fair and efficient allocation of indivisible chores

Fair and efficient allocations of chores under bivalued preferences

Aniket Murhekar Information

University

Position

___

Citations(all)

220

Citations(since 2020)

210

Cited By

34

hIndex(all)

8

hIndex(since 2020)

8

i10Index(all)

7

i10Index(since 2020)

7

Email

University Profile Page

Google Scholar

Aniket Murhekar Skills & Research Interests

Fair Division

Algorithmic Game Theory

Theoretical Computer Science

Top articles of Aniket Murhekar

Weighted EF1 and PO Allocations with Few Types of Agents or Chores

arXiv preprint arXiv:2402.17173

2024/2/27

Jugal Garg
Jugal Garg

H-Index: 15

Aniket Murhekar
Aniket Murhekar

H-Index: 3

Incentives in federated learning: Equilibria, dynamics, and mechanisms for welfare maximization

Advances in Neural Information Processing Systems

2024/2/13

Aniket Murhekar
Aniket Murhekar

H-Index: 3

Bo Li
Bo Li

H-Index: 27

Ruta Mehta
Ruta Mehta

H-Index: 13

Nash Equilibria of Two-Player Matrix Games Repeated Until Collision

arXiv preprint arXiv:2309.15870

2023/9/26

Aniket Murhekar
Aniket Murhekar

H-Index: 3

Computing fair and efficient allocations with few utility values

Theoretical Computer Science

2023/6/22

Jugal Garg
Jugal Garg

H-Index: 15

Aniket Murhekar
Aniket Murhekar

H-Index: 3

Brief announcement: Dynamic vector bin packing for online resource allocation in the cloud

2023/6/17

Aniket Murhekar
Aniket Murhekar

H-Index: 3

Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud

arXiv preprint arXiv:2304.08648

2023/4/17

Aniket Murhekar
Aniket Murhekar

H-Index: 3

Anup Rao
Anup Rao

H-Index: 18

New algorithms for the fair and efficient allocation of indivisible chores

arXiv preprint arXiv:2212.02440

2022/12/5

Jugal Garg
Jugal Garg

H-Index: 15

Aniket Murhekar
Aniket Murhekar

H-Index: 3

Fair and efficient allocations of chores under bivalued preferences

Proceedings of the AAAI Conference on Artificial Intelligence

2022/6/28

Jugal Garg
Jugal Garg

H-Index: 15

Aniket Murhekar
Aniket Murhekar

H-Index: 3

Computing pareto-optimal and almost envy-free allocations of indivisible goods

arXiv preprint arXiv:2204.14229

2022/4/29

Jugal Garg
Jugal Garg

H-Index: 15

Aniket Murhekar
Aniket Murhekar

H-Index: 3

(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna

arXiv preprint arXiv:2202.02672

2022/2/6

Tractable fragments of the maximum nash welfare problem

arXiv preprint arXiv:2112.10199

2021/12/19

Jugal Garg
Jugal Garg

H-Index: 15

Aniket Murhekar
Aniket Murhekar

H-Index: 3

On fair and efficient allocations of indivisible public goods

arXiv preprint arXiv:2107.09871

2021/7/21

On fair and efficient allocations of indivisible goods

Proceedings of the AAAI Conference on Artificial Intelligence

2021/5/18

Aniket Murhekar
Aniket Murhekar

H-Index: 3

Jugal Garg
Jugal Garg

H-Index: 15

Generating a targeted summary of textual content tuned to a target audience vocabulary

2020/1/14

Approximate nash equilibria of imitation games: Algorithms and complexity

AAMAS Conference proceedings

2020/1

Aniket Murhekar
Aniket Murhekar

H-Index: 3

Near-optimal complexity bounds for fragments of the Skolem problem

2020

See List of Professors in Aniket Murhekar University(University of Illinois at Urbana-Champaign)

Co-Authors

academic-engine