default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKrishnamurthy Iyer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Jerry Anunrojwong
, Krishnamurthy Iyer, David Lingenbrink:
Persuading Risk-Conscious Agents: A Geometric Approach. Oper. Res. 72(1): 151-166 (2024)- 2023
- [j9]Jerry Anunrojwong, Krishnamurthy Iyer, Vahideh H. Manshadi:
Information Design for Congested Social Services: Optimal Need-Based Persuasion. Manag. Sci. 69(7): 3778-3796 (2023) - [i7]Krishnamurthy Iyer, Haifeng Xu, You Zu:
Markov Persuasion Processes with Endogenous Agent Beliefs. CoRR abs/2307.03181 (2023) - 2022
- [i6]Jerry Anunrojwong, Krishnamurthy Iyer, David Lingenbrink:
Persuading Risk-Conscious Agents: A Geometric Approach. CoRR abs/2208.03758 (2022) - 2021
- [j8]Dragos Florin Ciocan, Krishnamurthy Iyer:
Tractable Equilibria in Sponsored Search with Endogenous Budgets. Oper. Res. 69(1): 227-244 (2021) - [j7]Artur Gorokh, Siddhartha Banerjee, Krishnamurthy Iyer:
From Monetary to Nonmonetary Mechanism Design via Artificial Currencies. Math. Oper. Res. 46(3): 835-855 (2021) - [c14]Artur Gorokh, Siddhartha Banerjee, Krishnamurthy Iyer:
The Remarkable Robustness of the Repeated Fisher Market. EC 2021: 562 - [c13]You Zu, Krishnamurthy Iyer, Haifeng Xu:
Learning to Persuade on the Fly: Robustness Against Ignorance. EC 2021: 927-928 - [i5]You Zu, Krishnamurthy Iyer, Haifeng Xu:
Learning to Persuade on the Fly: Robustness Against Ignorance. CoRR abs/2102.10156 (2021) - 2020
- [c12]Jerry Anunrojwong, Krishnamurthy Iyer, Vahideh H. Manshadi:
Information Design for Congested Social Services: Optimal Need-Based Persuasion. EC 2020: 349-350 - [i4]Jerry Anunrojwong, Krishnamurthy Iyer, Vahideh H. Manshadi:
Information Design for Congested Social Services: Optimal Need-Based Persuasion. CoRR abs/2005.07253 (2020)
2010 – 2019
- 2019
- [j6]David Lingenbrink, Krishnamurthy Iyer:
Optimal Signaling Mechanisms in Unobservable Queues. Oper. Res. 67(5): 1397-1416 (2019) - [c11]Jerry Anunrojwong, Krishnamurthy Iyer, David Lingenbrink:
Persuading Risk-Conscious Agents: A Geometric Approach. WINE 2019: 334 - [c10]Pu Yang, Krishnamurthy Iyer, Peter I. Frazier:
Information Design in Spatial Resource Competition. WINE 2019: 346 - [i3]Pu Yang, Krishnamurthy Iyer, Peter I. Frazier:
Information Design in Spatial Resource Competition. CoRR abs/1909.12723 (2019) - 2018
- [c9]David Lingenbrink, Krishnamurthy Iyer:
Signaling in Online Retail: Efficacy of Public Signals. NetEcon@SIGMETRICS 2018: 10:1 - 2017
- [j5]Jiayang Gao, Krishnamurthy Iyer, Huseyin Topaloglu:
Price competition under linear demand and finite inventories: Contraction and approximate equilibria. Oper. Res. Lett. 45(4): 382-387 (2017) - [c8]David Lingenbrink, Krishnamurthy Iyer:
Optimal Signaling Mechanisms in Unobservable Queues with Strategic Customers. EC 2017: 347 - [c7]Artur Gorokh, Siddhartha Banerjee, Krishnamurthy Iyer:
From Monetary to Non-Monetary Mechanism Design via Artificial Currencies. EC 2017: 563-564 - [i2]Pu Yang, Krishnamurthy Iyer, Peter I. Frazier:
Mean Field Equilibria for Resource Competition in Spatial Settings. CoRR abs/1707.07919 (2017) - 2016
- [c6]Artur Gorokh, Siddhartha Banerjee, Krishnamurthy Iyer:
Near-Efficient Allocation Using Artificial Currency in Repeated Settings. WINE 2016: 476-477 - [c5]Pu Yang, Krishnamurthy Iyer, Peter I. Frazier:
Mean Field Equilibria for Competitive Exploration in Resource Sharing Settings. WWW 2016: 177-187 - [i1]Pu Yang, Krishnamurthy Iyer, Peter I. Frazier:
Mean Field Equilibria for Competitive Exploration in Resource Sharing Settings. CoRR abs/1602.06571 (2016) - 2014
- [j4]Krishnamurthy Iyer, Ramesh Johari, Ciamac C. Moallemi:
Information Aggregation and Allocative Efficiency in Smooth Markets. Manag. Sci. 60(10): 2509-2524 (2014) - [j3]Krishnamurthy Iyer, Ramesh Johari, Mukund Sundararajan:
Mean Field Equilibria of Dynamic Auctions with Learning. Manag. Sci. 60(12): 2949-2970 (2014) - 2012
- [c4]Krishnamurthy Iyer, Ramesh Johari, Ciamac Cyrus Moallemi:
Information and the value of execution guarantees. EC 2012: 673 - 2011
- [j2]Krishnamurthy Iyer, Ramesh Johari, Mukund Sundararajan:
Mean field equilibria of dynamic auctions with learning. SIGecom Exch. 10(3): 10-14 (2011) - [c3]Krishnamurthy Iyer, Ramesh Johari, Mukund Sundararajan:
Mean field equilibria of dynamic auctions with learning: A dynamic revenue equivalence theorem. Allerton 2011: 1002-1003 - [c2]Krishnamurthy Iyer, Ramesh Johari, Mukund Sundararajan:
Mean field equilibria of dynamic auctions with learning. EC 2011: 339-340 - 2010
- [j1]Krishnamurthy Iyer, Nandyala Hemachandra:
Sensitivity analysis and optimal ultimately stationary deterministic policies in some constrained discounted cost models. Math. Methods Oper. Res. 71(3): 401-425 (2010) - [c1]Krishnamurthy Iyer, Ramesh Johari, Ciamac Cyrus Moallemi:
Information aggregation in smooth markets. EC 2010: 199-206
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 2025-01-21 00:16 CET 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:
