Prof. Yonatan Aumann

Algorithms, Game Theory, and Computational Economics

In many life situations, limited resources must be divided among various parties, each with its own preferences and interests. The challenge is not only to find an efficient solution but also one that is perceived as fair.  

An example is student registration for highly sought-after university courses. For such courses, what is the right and fair way to allocate the limited number of seats among interested students? If there is only one course, a lottery can be held. But what should be done when there are several highly sought-after courses, and different students want different subsets of them? How can such a complex lottery be conducted? What are the required or desirable properties of a registration method?  what algorithms are required to support such a method?

Prof. Yonatan Aumann studies how to design algorithms that enable the fair allocation of resources in such situations. His research combines algorithms and game theory and focuses on settings in which different agents act with conflicting interests — asking what systems and rules can be designed to lead to fair and stable outcomes.

Primary Research Areas:

• Fair Division & Social Choice

• Algorithmic Game Theory and Multi-Agent Systems

• Cryptography

• Distributed Algorithms

Research Nature:

 Theoretical-Applied: Developing mathematical models and algorithms to solve resource allocation problems and complex decision-making.

Career Path:

 Graduates in this field integrate into a variety of roles:

• High-Tech and Fintech: Trading systems, optimization, and computational economics.

• Research and Development (R&D): Algorithms, Artificial Intelligence, and game theory.

• Academia: Researchers and lecturers in the fields of algorithmics, game theory, and computational economics.

• Cyber and Information Security: System and protocol design.