In the Ultimatum Game (UG) one player, named “proposer”, has to decide how to allocate a certain amount of money between herself and a “responder”. If the offer is greater than or equal to the responder’s minimum acceptable offer (MAO), then the money is split as proposed, otherwise,...

Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks)...

We present a quantum solution to coordination problems that can be implemented with existing technologies. It provides an alternative to existing approaches, which rely on explicit communication, prior commitment or trusted third parties. This quantum mechanism applies to a variety of scenarios...

In many contexts an individual's beliefs and behavior are affected by the choices of his or her social or geographic neighbors. This influence results in local correlation in people's actions, which in turn affects how information and behaviors spread. Previously developed frameworks capture...

The purpose is to discuss, using examples, issues in game theory which have been occasionally discussed and not always fully. There has been intense research and progress in academic journal and specialized volumes, but there is scope for a simple analysis of the basic ideas through further...

This paper studies Myerson's neutral bargaining solution for a class of Bayesian bargaining problems in which the solution is unique. For this class of examples, I consider a noncooperative mechanism-selection game. I find that all of the interim incentive efficient mechanisms can be supported...

This paper studies an allocation procedure for coalitional games with veto players. The procedure is similar to the one presented by Arin and Feltkamp (2007), which is based on Dagan et al. (1997). A distinguished player makes a proposal that the remaining players must accept or reject, and...

We provide a new interpretation of the Nash solution, using fictitious play. We show that the Nash demand game has the fictitious play property almost everywhere, and present two initial demand games which exactly and approximately implement the Nash solution. Thanks to the exact implementation...

The value is a solution concept for n-person strategic games, developed by Nash, Shapley, and Harsanyi. The value provides an a priori evaluation of the economic worth of the position of each player, reflecting the players' strategic possibilities, including their ability to make threats against...