World's Best Scientists 2026 revealed!
Jeffrey S. Rosenschein

Jeffrey S. Rosenschein

D-Index & Metrics

Computer Science

D-Index
56
Citations
13837
World Ranking
4038
National Ranking
62

Research.com Recognitions

  • 2019 - ACM Fellow For contributions to multi-agent systems, in particular, the use of game theory in multi-agent systems
  • 2009 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For significant contributions to multiagent systems, automated negotiation, voting mechanisms, and to bringing game-theoretic mechanism design into computer science.

Overview

Jeffrey S. Rosenschein is affiliated with the Hebrew University of Jerusalem in Israel. Their research primarily falls within the field of Computer Science, with a significant focus on several subfields including Artificial Intelligence, Signal Processing, Sociology and Political Science, Cognitive Neuroscience, and Computer Vision and Pattern Recognition.

Their work spans multiple topics, notably Music and Audio Processing, Music Technology and Sound Studies, Misinformation and Its Impacts, Psychology of Moral and Emotional Judgment, Evolutionary Game Theory and Cooperation, Metaheuristic Optimization Algorithms Research, and Constraint Satisfaction and Optimization.

Frequent co-authors of Jeffrey S. Rosenschein include N. Alon, Lion Schulz, Peter Dayan, Shahaf Bassan, and Yossi Adi.

Their recent published papers include:

  • Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics, 2021, Proceedings of the International Symposium on Combinatorial Search
  • A (Dis-)information Theory of Revealed and Unrevealed Preferences: Emerging Deception and Skepticism via Theory of Mind, 2023, Open Mind
  • Unsupervised Symbolic Music Segmentation using Ensemble Temporal Prediction Errors, 2022, Interspeech 2022
  • Reaching consensus under a deadline, 2021, Autonomous Agents and Multi-Agent Systems
  • Understanding Mechanism Design-Part 2 of 3: The Vickrey-Clarke-Groves Mechanism, 2021, IEEE Intelligent Systems

Jeffrey S. Rosenschein has published frequently in venues such as arXiv (Cornell University), Open Mind, Proceedings of the International Symposium on Combinatorial Search, Interspeech 2022, and Autonomous Agents and Multi-Agent Systems.

The scientist has received the ACM Fellow award in 2019 for contributions to multi-agent systems, specifically the use of game theory within that domain. Additionally, they were recognized as a Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) in 2009 for significant contributions related to multiagent systems, automated negotiation, voting mechanisms, and incorporating game-theoretic mechanism design into computer science.

Best Publications

  • Rules of encounter: designing conventions for automated negotiation among computers

    Jeffrey S. Rosenschein;Gilad Zlotkin

  • Deals among rational agents

    Jeffrey S. Rosenschein;Michael R. Genesereth

  • Cooperation without communication

    Michael R. Genesereth;Matthew L. Ginsberg;Jeffrey S. Rosenschein

  • Junta distributions and the average-case complexity of manipulating elections

    Ariel D. Procaccia;Jeffrey S. Rosenschein

  • Ad hoc autonomous agent teams: collaboration without pre-coordination

    Peter Stone;Gal A. Kaminka;Sarit Kraus;Jeffrey S. Rosenschein

  • Negotiation and task sharing among autonomous agents in cooperative domains

    Gilad Zlotkin;Jeffrey S. Rosenschein

  • A specification of the Agent Reputation and Trust (ART) testbed: experimentation and competition for trust in agent societies

    Karen K. Fullam;Tomas B. Klos;Guillaume Muller;Jordi Sabater

  • Coalition, Cryptography, and Stability: Mechanisms for Coalition Formation in Task Oriented Domains

    Gilad Zlotkin;Jeffrey S. Rosenschein

  • Bitcoin Mining Pools: A Cooperative Game Theoretic Analysis

    Yoad Lewenberg;Yoram Bachrach;Yonatan Sompolinsky;Aviv Zohar

  • Designing conventions for automated negotiation

    Jeffrey S. Rosenschein;Gilad Zlotkin

  • Distributed Problem Solving and Multi-Agent Systems: Comparisons and Examples*

    Edmund H. Durfee;Jeffrey S. Rosenschein

  • The Clarke tax as a consensus mechanism among automated agents

    Eithan Ephrati;Jeffrey S. Rosenschein

  • Rational interaction: cooperation among intelligent agents

    Jeffrey Solomon Rosenschein

  • On the complexity of achieving proportional representation

    Ariel D. Procaccia;Jeffrey S. Rosenschein;Aviv Zohar

  • Research directions for service-oriented multiagent systems

    M.N. Huhns;M.P. Singh;M. Burstein;K. Decker

  • Cooperation and conflict resolution via negotiation among autonomous agents in noncooperative domains

    G. Zlotkin;J.S. Rosenschein

  • The distortion of cardinal preferences in voting

    Ariel D. Procaccia;Jeffrey S. Rosenschein

  • Mechanisms for automated negotiation in state oriented domains

    Gilad Zlotkin;Jeffrey S. Rosenschein

  • Multi-agent planning as a dynamic search for social consensus

    Eithan Ephrati;Jeffrey S. Rosenschein

  • Divide and conquer in multi-agent planning

    Eithan Ephrati;Jeffrey S. Rosenschein

  • Gossip-based aggregation of trust in decentralized reputation systems

    Ariel D. Procaccia;Yoram Bachrach;Jeffrey S. Rosenschein

Frequent Co-Authors

Yoram Bachrach
Yoram Bachrach DeepMind (United Kingdom)
Ariel D. Procaccia
Ariel D. Procaccia Harvard University
Sarit Kraus
Sarit Kraus Bar-Ilan University
Michael R. Genesereth
Michael R. Genesereth Stanford University
Gal A. Kaminka
Gal A. Kaminka Bar-Ilan University
Ariel Felner
Ariel Felner Ben-Gurion University of the Negev
Michael Wooldridge
Michael Wooldridge University of Oxford
Maria Gini
Maria Gini University of Minnesota
Toby Walsh
Toby Walsh University of New South Wales
Edith Elkind
Edith Elkind University of Oxford

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens doors to a wide range of professions and further academic opportunities. Many students consider what complements their studies or how to continue their education online. For instance, students often research the most useful degrees that can boost career potential alongside or after a computer science major.

For those interested in advancing quickly, some opt for the easiest masters degree to get online, which offers a quicker and more flexible route to career advancement. Such programs are ideal for those who want to balance work and study.

If you’re considering doctoral studies but are concerned about cost, exploring the cheapest online PhD programs can help you find budget-friendly options without compromising academic quality. Alternatively, aspiring educators might be interested in 2 year ed d programs online for a fast track to leadership roles in academia or administration.

With so many flexible and affordable online degrees now available, there’s a career progression path suited to every ambition within the field of computer science.

Best Scientists Citing Jeffrey S. Rosenschein

Trending Scientists

Recently Published Articles