Michael Kearns
About
In The Last Decade
Michael Kearns
171 papers receiving 10.5k citations
Hit Papers
Peers
Comparison fields: 5 of 191
- Artificial Intelligence 6.9k
- Management Science and Operations Research 2.3k
- Computational Theory and Mathematics 1.9k
- Computer Networks and Communications 1.5k
- Computer Vision and Pattern Recognition 865
Countries citing papers authored by Michael Kearns
This map shows the geographic impact of Michael Kearns's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Kearns with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Kearns more than expected).
Fields of papers citing papers by Michael Kearns
This network shows the impact of papers produced by Michael Kearns. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Kearns. The network helps show where Michael Kearns may publish in the future.
Co-authorship network of co-authors of Michael Kearns
This figure shows the co-authorship network connecting the top 25 collaborators of Michael Kearns. A scholar is included among the top collaborators of Michael Kearns based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michael Kearns. Michael Kearns is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | Meritocratic fairness for cross-population selection | 13 |
| 3 | Pursuit-Evasion Without Regret, with an Application to Trading | 1 |
| 4 | 19 | |
| 5 | Large-Scale Bandit Problems and KWIK Learning | 5 |
| 6 | Local Algorithms for Finding Interesting Individuals in Large Networks | 12 |
| 7 | Privacy-Preserving Belief Propagation and Sampling | 10 |
| 8 | Algorithms for Interdependent Security Games | 45 |
| 9 | Exploration in metric state spaces | 49 |
| 10 | 2 | |
| 11 | A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics | 2 |
| 12 | Empirical Evaluation of a Reinforcement Learning Spoken Dialogue System | 29 |
| 13 | Cobot in LambdaMOO: A Social Statistics Agent | 41 |
| 14 | Nash convergence of gradient dynamics in general-sum games | 152 |
| 15 | Bias-Variance Error Bounds for Temporal Difference Updates | 27 |
| 16 | A sparse sampling algorithm for near-optimal planning in large Markov decision processes | 129 |
| 17 | Reinforcement Learning for Spoken Dialogue Systems | 106 |
| 18 | A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization | 44 |
| 19 | 4 | |
| 20 | Learning in the Presence of Malicious Errors (Extended Abstract) | 3 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.