In order to succeed, agents playing games must reason about the mechanics of the game, the strategies of other agents, other agents’ reasoning about their strategies, and the ra...
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Many day-to-day tasks require negotiation, mostly under conditions of incomplete information. In particular, the opponent's exact tradeoff between different offers is usually ...
Raz Lin, Sarit Kraus, Jonathan Wilkenfeld, James B...
Abstract. Nelson and Oppen provided a methodology for modularly combining decision procedures for individual theories to construct a decision procedure for a combination of theorie...
—The relevance of instruction parallelization and optimal event scheduling is currently increasing. In particular, because of the high amount of computational power available tod...