Eshwar Ram Arunachaleswaran

Orcid: 0009-0006-2988-2491

According to our database1, Eshwar Ram Arunachaleswaran authored at least 14 papers between 2018 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
An Elementary Predictor Obtaining Distance to Calibration.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
Learning to Play Against Unknown Opponents.
CoRR, 2024

Algorithmic Collusion Without Threats.
CoRR, 2024

An Elementary Predictor Obtaining 2√T Distance to Calibration.
CoRR, 2024

Pareto-Optimal Algorithms for Learning in Games.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Oracle Efficient Algorithms for Groupwise Regret.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Wealth Dynamics Over Generations: Analysis and Interventions.
Proceedings of the 2023 IEEE Conference on Secure and Trustworthy Machine Learning, 2023

Efficient Stackelberg Strategies for Finitely Repeated Games.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Reconstructing Ultrametric Trees from Noisy Experiments.
Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022
Pipeline Interventions.
Math. Oper. Res., November, 2022

Fully Polynomial-Time Approximation Schemes for Fair Rent Division.
Math. Oper. Res., 2022

2019
Fair and Efficient Cake Division with Connected Pieces.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Fair Division with a Secretive Agent.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
The Price of Indivisibility in Cake Cutting.
CoRR, 2018


  Loading...