Learn More
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about uncertainty and multi-agent systems. When the set of agents and the set of alternatives coincide, we get the ranking systems setting. A famous type of ranking systems are page ranking systems(More)
This paper describes the process of building the first tree-bank for Modern Hebrew texts. A major concern in this process is the need for reducing the cost of manual annotation by the use of automatic means. To this end, the joint utility of an automatic morphological ana-lyzer, a probabilistic parser and a small manually annotated tree-bank was explored.(More)
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about multi-agent systems. When the set of agents and the set of alternatives coincide , we get the ranking systems setting. A famous type of ranking systems are page ranking systems in the context(More)
Knockout tournaments provide a common and important framework for structuring sporting competitions, worth billions of dollars every year in the global economy. Knockout tournaments also model a specific type of election scheme: namely, sequential pairwise elimination elections. The designer of a tournament typically controls both the shape of the(More)
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and the exact rationale of page ranking algorithms we suggest the axiomatic approach taken in the formal theory of social choice. In this paper we deal with PageRank, the most famous(More)
We propose a machine learning approach to action prediction in one-shot games. In contrast to the huge literature on learning in games where an agent's model is deduced from its previous actions in a multi-stage game, we propose the idea of inferring correlations between agents' actions in different one-shot games in order to predict an agent's action in a(More)
We discuss CUECARD, the program that won the 2008 Computer Olympiad computational pool tournament. Beside addressing intrinsic interest in a complex competitive environment with unique features , our goal is to isolate the factors that contributed to the performance so that the lessons can be transferred to other, similar domains. Specifically , we(More)