Ruta Mehta

Ruta Mehta

University of Illinois at Urbana-Champaign

H-index: 18

North America-United States

About Ruta Mehta

Ruta Mehta, With an exceptional h-index of 18 and a recent h-index of 16 (since 2020), a distinguished researcher at University of Illinois at Urbana-Champaign, specializes in the field of Algorithmic Game Theory, Economics, Theoretical Computer Science.

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

Minimization is Harder in the Prophet World

On the existence of EFX under picky or non-differentiative agents

On the structure of envy-free orientations on graphs

1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations

Competitive Equilibrium for Chores: from Dual Eisenberg-Gale to a Fast, Greedy, LP-based Algorithm

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

Fair and efficient allocation of indivisible chores with surplus

Maximin share allocations for assignment valuations

Ruta Mehta Information

University

Position

Dept. of Computer Science

Citations(all)

1141

Citations(since 2020)

805

Cited By

600

hIndex(all)

18

hIndex(since 2020)

16

i10Index(all)

36

i10Index(since 2020)

30

Email

University Profile Page

University of Illinois at Urbana-Champaign

Google Scholar

View Google Scholar Profile

Ruta Mehta Skills & Research Interests

Algorithmic Game Theory

Economics

Theoretical Computer Science

Top articles of Ruta Mehta

Title

Journal

Author(s)

Publication Date

Minimization is Harder in the Prophet World

Vasilis Livanos

Ruta Mehta

2024

On the existence of EFX under picky or non-differentiative agents

Maya Viswanathan

Ruta Mehta

2024/5/6

On the structure of envy-free orientations on graphs

arXiv preprint arXiv:2404.13527

Jinghan A Zeng

Ruta Mehta

2024/4/21

1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations

Proceedings of the AAAI Conference on Artificial Intelligence

Chandra Chekuri

Pooja Kulkarni

Rucha Kulkarni

Ruta Mehta

2024/3/24

Competitive Equilibrium for Chores: from Dual Eisenberg-Gale to a Fast, Greedy, LP-based Algorithm

arXiv preprint arXiv:2402.10439

Bhaskar Ray Chaudhury

Christian Kroer

Ruta Mehta

Tianlong Nan

2024/2/16

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

Advances in Neural Information Processing Systems

Aniket Murhekar

Zhuowen Yuan

Bhaskar Ray Chaudhury

Bo Li

Ruta Mehta

2024/2/13

Fair and efficient allocation of indivisible chores with surplus

arXiv preprint arXiv:2305.04788

Hannaneh Akrami

Bhaskar Ray Chaudhury

Jugal Garg

Kurt Mehlhorn

Ruta Mehta

2023/5/8

Maximin share allocations for assignment valuations

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems

Pooja Kulkarni

Rucha Kulkarni

Ruta Mehta

2023/1

Approximating APS under Submodular and XOS valuations with Binary Marginals

arXiv preprint arXiv:2312.08509

Pooja Kulkarni

Rucha Kulkarni

Ruta Mehta

2023/12/13

Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number

Mathematics of Operations Research

Bhaskar Ray Chaudhury

Jugal Garg

Kurt Mehlhorn

Ruta Mehta

Pranabendu Misra

2023/11/22

A complementary pivot algorithm for competitive allocation of a mixed manna

Mathematics of Operations Research

Bhaskar Ray Chaudhury

Jugal Garg

Peter McGlaughlin

Ruta Mehta

2023/8

EFX: a simpler approach and an (almost) optimal guarantee via rainbow cycle number

Hannaneh Akrami

Noga Alon

Bhaskar Ray Chaudhury

Jugal Garg

Kurt Mehlhorn

...

2023/7/9

On the existence of competitive equilibrium with chores

13th Innovations in Theoretical Computer Science Conference (ITCS 2022)

Bhaskar Ray Chaudhury

Jugal Garg

Peter McGlaughlin

Ruta Mehta

2022/1

Prophet inequalities for cost minimization

arXiv preprint arXiv:2209.07988

Vasilis Livanos

Ruta Mehta

2022/9/16

Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores∗

Shant Boodaghians

Bhaskar Ray Chaudhury

Ruta Mehta

2022

Competitive equilibrium with chores: Combinatorial algorithm and hardness

Bhaskar Ray Chaudhury

Jugal Garg

Peter McGlaughlin

Ruta Mehta

2022/7/12

EFX allocations: Simplifications and improvements

arXiv preprint arXiv:2205.07638

Hannaneh Akrami

Noga Alon

Bhaskar Ray Chaudhury

Jugal Garg

Kurt Mehlhorn

...

2022/5/16

Fairness in federated learning via core-stability

Advances in neural information processing systems

Bhaskar Ray Chaudhury

Linyi Li

Mintong Kang

Bo Li

Ruta Mehta

2022/12/6

Online revenue maximization for server pricing

Autonomous Agents and Multi-Agent Systems

Shant Boodaghians

Federico Fusco

Stefano Leonardi

Yishay Mansour

Ruta Mehta

2022/4

On the envy-free allocation of chores

arXiv preprint arXiv:2211.15836

Lang Yin

Ruta Mehta

2022/11/29

See List of Professors in Ruta Mehta University(University of Illinois at Urbana-Champaign)

Co-Authors

H-index: 94
Milind Tambe

Milind Tambe

Harvard University

H-index: 76
Noam Nisan

Noam Nisan

Hebrew University of Jerusalem

H-index: 53
Maria-Florina Balcan

Maria-Florina Balcan

Carnegie Mellon University

H-index: 35
Georgios Piliouras

Georgios Piliouras

Singapore University of Technology and Design

H-index: 31
Albert X. Jiang

Albert X. Jiang

Trinity University

H-index: 27
Rahul Savani

Rahul Savani

University of Liverpool

academic-engine