◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

E. Arunachaleswaran

15 papers hereh-index 7154 citations21 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author12
  • middle author3

Across the 15 of 15 papers where every author was matched, so the position is known.

fields
  • cs.GT11
  • cs.LG3
  • cs.DS1

identity via Semantic Scholar / OpenAlex

activity
20182025
most citedAlgorithmic Collusion Without Threats

2 citations · 5 across the 12 of their papers we have counts for

collaborators
Showing 2018Show all

3 papers · 1 filter

cs.GT2018

Fair Division with a Secretive Agent

Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi

We study classic fair-division problems in a partial information setting. This paper respectively addresses fair division of rent, cake, and indivisible goods among agents with car…

cs.GT2018

Fully Polynomial-Time Approximation Schemes for Fair Rent Division

Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi

We study the problem of fair rent division that entails splitting the rent and allocating the rooms of an apartment among roommates (agents) in a fair manner. In this setup, a dist…

cs.GT2018★ 2 cited

The Price of Indivisibility in Cake Cutting

Eshwar Ram Arunachaleswaran, Ragavendran Gopalakrishnan

We consider the problem of envy-free cake cutting, which is the distribution of a continuous heterogeneous resource among self interested players such that nobody prefers what some…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.