default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEshwar Ram Arunachaleswaran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Krishna Acharya, Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, Juba Ziani:
Oracle Efficient Algorithms for Groupwise Regret. ICLR 2024- [i12]Eshwar Ram Arunachaleswaran, Natalie Collina, Jon Schneider:
Pareto-Optimal Algorithms for Learning in Games. CoRR abs/2402.09549 (2024) - [i11]Eshwar Ram Arunachaleswaran, Natalie Collina, Aaron Roth, Mirah Shi:
An Elementary Predictor Obtaining 2√T Distance to Calibration. CoRR abs/2402.11410 (2024) - [i10]Eshwar Ram Arunachaleswaran, Natalie Collina, Sampath Kannan, Aaron Roth, Juba Ziani:
Algorithmic Collusion Without Threats. CoRR abs/2409.03956 (2024) - 2023
- [c7]Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan:
Reconstructing Ultrametric Trees from Noisy Experiments. ALT 2023: 82-114 - [c6]Natalie Collina, Eshwar Ram Arunachaleswaran, Michael Kearns:
Efficient Stackelberg Strategies for Finitely Repeated Games. AAMAS 2023: 643-651 - [c5]Krishna Acharya, Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth
, Juba Ziani:
Wealth Dynamics Over Generations: Analysis and Interventions. SaTML 2023: 42-57 - [i9]Krishna Acharya, Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, Juba Ziani:
Oracle Efficient Algorithms for Groupwise Regret. CoRR abs/2310.04652 (2023) - 2022
- [j2]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fully Polynomial-Time Approximation Schemes for Fair Rent Division. Math. Oper. Res. 47(3): 1970-1998 (2022) - [j1]Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, Juba Ziani:
Pipeline Interventions. Math. Oper. Res. 47(4): 3207-3238 (2022) - [i8]Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan:
Reconstructing Ultrametric Trees from Noisy Experiments. CoRR abs/2206.07672 (2022) - [i7]Eshwar Ram Arunachaleswaran, Natalie Collina, Michael Kearns:
Efficient Stackelberg Strategies for Finitely Repeated Games. CoRR abs/2207.04192 (2022) - [i6]Krishna Acharya, Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, Juba Ziani:
Wealth Dynamics Over Generations: Analysis and Interventions. CoRR abs/2209.07375 (2022) - 2021
- [c4]Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, Juba Ziani:
Pipeline Interventions. ITCS 2021: 8:1-8:20 - 2020
- [i5]Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, Juba Ziani:
Pipeline Interventions. CoRR abs/2002.06592 (2020)
2010 – 2019
- 2019
- [c3]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fair Division with a Secretive Agent. AAAI 2019: 1732-1739 - [c2]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fully Polynomial-Time Approximation Schemes for Fair Rent Division. SODA 2019: 1994-2013 - [c1]Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, Nidhi Rathi:
Fair and Efficient Cake Division with Connected Pieces. WINE 2019: 57-70 - [i4]Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, Nidhi Rathi:
Fair and Efficient Cake Division with Connected Pieces. CoRR abs/1907.11019 (2019) - 2018
- [i3]Eshwar Ram Arunachaleswaran, Ragavendran Gopalakrishnan:
The Price of Indivisibility in Cake Cutting. CoRR abs/1801.08341 (2018) - [i2]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fully Polynomial-Time Approximation Schemes for Fair Rent Division. CoRR abs/1807.04163 (2018) - [i1]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fair Division with a Secretive Agent. CoRR abs/1811.10859 (2018)
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-10 21:17 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:
