default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShreyas Sekar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Evi Micha, Shreyas Sekar, Nisarg Shah:
What Is Best for Students, Numerical Scores or Letter Grades? IJCAI 2024: 2949-2957- [i18]Evi Micha, Shreyas Sekar, Nisarg Shah:
What is Best for Students, Numerical Scores or Letter Grades? CoRR abs/2406.15405 (2024) - 2023
- [j8]Shreyas Sekar:
Technical Perspective: A Rare Glimpse of Tracking Fake Reviews. Commun. ACM 66(10): 97 (2023) - [j7]Negin Golrezaei
, Vahideh H. Manshadi, Jon Schneider, Shreyas Sekar:
Learning Product Rankings Robust to Fake Users. Oper. Res. 71(4): 1171-1196 (2023) - 2022
- [j6]Kris Johnson Ferreira, Sunanda Parthasarathy, Shreyas Sekar:
Learning to Rank an Assortment of Products. Manag. Sci. 68(3): 1828-1848 (2022) - [j5]Pan Li, Shreyas Sekar, Baosen Zhang:
A Capacity-Price Game for Uncertain Renewables Resources. IEEE Trans. Sustain. Comput. 7(3): 527-536 (2022) - 2021
- [j4]Shreyas Sekar, Milan Vojnovic, Se-Young Yun:
A Test Score-Based Approach to Stochastic Submodular Optimization. Manag. Sci. 67(2): 1075-1092 (2021) - [c16]Negin Golrezaei, Vahideh H. Manshadi, Jon Schneider, Shreyas Sekar:
Learning Product Rankings Robust to Fake Users. EC 2021: 560-561 - 2020
- [j3]Shreyas Sekar, Liyuan Zheng, Lillian J. Ratliff, Baosen Zhang:
Uncertainty in Multicommodity Routing Networks: When Does It Help? IEEE Trans. Autom. Control. 65(11): 4600-4615 (2020) - [i17]Negin Golrezaei, Vahideh H. Manshadi, Jon Schneider, Shreyas Sekar:
Learning Product Rankings Robust to Fake Users. CoRR abs/2009.05138 (2020)
2010 – 2019
- 2019
- [j2]Lillian J. Ratliff, Roy Dong, Shreyas Sekar, Tanner Fiez:
A Perspective on Incentive Design: Challenges and Opportunities. Annu. Rev. Control. Robotics Auton. Syst. 2: 305-338 (2019) - 2018
- [c15]Shreyas Sekar, Liyuan Zheng, Lillian J. Ratliff, Baosen Zhang:
Uncertainty in Multi-Commodity Routing Networks: When does it help? ACC 2018: 6553-6558 - [c14]Pan Li, Shreyas Sekar, Baosen Zhang:
A Capacity-Price Game for Uncertain Renewables Resources. e-Energy 2018: 119-133 - [c13]Charalampos E. Tsourakakis, Shreyas Sekar, Johnson Lam, Liu Yang:
Risk-Averse Matchings over Uncertain Graph Databases. ECML/PKDD (2) 2018: 71-87 - [c12]Tanner Fiez, Shreyas Sekar, Liyuan Zheng, Lillian J. Ratliff:
Combinatorial Bandits for Incentivizing Agents with Dynamic Preferences. UAI 2018: 693-703 - [i16]Charalampos E. Tsourakakis, Shreyas Sekar, Johnson Lam, Liu Yang:
Risk-Averse Matchings over Uncertain Graph Databases. CoRR abs/1801.03190 (2018) - [i15]Lillian J. Ratliff, Shreyas Sekar, Liyuan Zheng, Tanner Fiez:
Incentives in the Dark: Multi-armed Bandits for Evolving Users with Unknown Type. CoRR abs/1803.04008 (2018) - [i14]Pan Li, Shreyas Sekar, Baosen Zhang:
A Capacity-Price Game for Uncertain Renewables Resources. CoRR abs/1804.06496 (2018) - [i13]Tanner Fiez, Shreyas Sekar, Liyuan Zheng, Lillian J. Ratliff:
Combinatorial Bandits for Incentivizing Agents with Dynamic Preferences. CoRR abs/1807.02297 (2018) - 2017
- [b1]Shreyas Sekar:
Non-discriminative algorithmic pricing: decentralized resource allocation in markets. Rensselaer Polytechnic Institute, USA, 2017 - [j1]Elliot Anshelevich, Koushik Kar, Shreyas Sekar:
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare. ACM Trans. Economics and Comput. 5(3): 16:1-16:42 (2017) - [c11]Shreyas Sekar, Sujoy Sikdar, Lirong Xia:
Condorcet Consistent Bundling with Social Choice. AAMAS 2017: 33-41 - [c10]Shreyas Sekar:
Posted Pricing sans Discrimination. IJCAI 2017: 388-394 - [c9]Elliot Anshelevich, Shreyas Sekar:
Price Doubling and Item Halving: Robust Revenue Guarantees for Item Pricing. EC 2017: 325-342 - [c8]Elliot Anshelevich, Koushik Kar, Shreyas Sekar, Zaid Bin Tariq:
Balancing social utility with aggregator profit in electric vehicle charging. SmartGridComm 2017: 369-374 - [i12]Shreyas Sekar, Liyuan Zheng, Lillian J. Ratliff, Baosen Zhang:
Uncertainty in Multi-Commodity Routing Networks: When does it help? CoRR abs/1709.08441 (2017) - 2016
- [c7]Elliot Anshelevich, Shreyas Sekar:
Blind, Greedy, and Random: Algorithms for Matching and Clustering Using Only Ordinal Information. AAAI 2016: 390-396 - [c6]Elliot Anshelevich, Koushik Kar, Shreyas Sekar:
Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets. WINE 2016: 145-159 - [c5]Elliot Anshelevich, Shreyas Sekar:
Truthful Mechanisms for Matching and Clustering in an Ordinal World. WINE 2016: 265-278 - [i11]Shreyas Sekar, Milan Vojnovic, Se-Young Yun:
Sketching with Test Scores and Submodular Maximization. CoRR abs/1605.07172 (2016) - [i10]Shreyas Sekar:
Posted Pricing sans Discrimination. CoRR abs/1609.06844 (2016) - [i9]Elliot Anshelevich, Shreyas Sekar:
Truthful Mechanisms for Matching and Clustering in an Ordinal World. CoRR abs/1610.04069 (2016) - [i8]Elliot Anshelevich, Koushik Kar, Shreyas Sekar:
Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets. CoRR abs/1610.04071 (2016) - [i7]Elliot Anshelevich, Shreyas Sekar:
Price Doubling and Item Halving: Robust Revenue Guarantees for Item Pricing. CoRR abs/1611.02442 (2016) - 2015
- [c4]Elliot Anshelevich, Koushik Kar, Shreyas Sekar:
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare. ICALP (1) 2015: 52-64 - [c3]Elliot Anshelevich, Shreyas Sekar:
Price Competition in Networked Markets: How Do Monopolies Impact Social Welfare? WINE 2015: 16-30 - [c2]Elliot Anshelevich, Shreyas Sekar:
Computing Stable Coalitions: Approximation Algorithms for Reward Sharing. WINE 2015: 31-45 - [i6]Elliot Anshelevich, Koushik Kar, Shreyas Sekar:
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare. CoRR abs/1503.00340 (2015) - [i5]Elliot Anshelevich, Shreyas Sekar:
Computing Stable Coalitions: Approximation Algorithms for Reward Sharing. CoRR abs/1508.06781 (2015) - [i4]Elliot Anshelevich, Shreyas Sekar:
Blind, Greedy, and Random: Ordinal Approximation Algorithms for Graph Problems. CoRR abs/1512.05504 (2015) - 2014
- [c1]Elliot Anshelevich, Shreyas Sekar:
Approximate Equilibrium and Incentivizing Social Coordination. AAAI 2014: 508-514 - [i3]Elliot Anshelevich, Shreyas Sekar:
Approximate Equilibrium and Incentivizing Social Coordination. CoRR abs/1404.4718 (2014) - [i2]Elliot Anshelevich, Shreyas Sekar:
Market price competition in networks: How do monopolies impact social welfare? CoRR abs/1410.1113 (2014) - 2012
- [i1]Shreyas Sekar, Patrick Maillé:
Exploiting the 'Web of Trust' to improve efficiency in collaborative networks. CoRR abs/1202.2888 (2012)
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-21 21:31 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:
