Games2015, 6(2), 39-56; doi:10.3390/g6020039 - published 22 April 2015 Show/Hide Abstract
Abstract: This paper analyses a model of legislative bargaining in which parties form tentative coalitions (protocoalitions) before deciding on the allocation of a resource. Protocoalitions may fail to reach an agreement, in which case they may be dissolved (breakdown) and a new protocoalition may form. We show that agreement is immediate in equilibrium, and the proposer advantage disappears as the breakdown probability goes to zero. We then turn to the special case of apex games and explore the consequences of varying the probabilities that govern the selection of formateurs and proposers. Letting the breakdown probability go to zero, most of the probabilities considered lead to the same ex post pay-off division. Ex ante expected pay-offs may follow a counterintuitive pattern: as the bargaining power of weak players within a protocoalition increases, the weak players may expect a lower pay-off ex ante.
Games2015, 6(1), 32-38; doi:10.3390/g6010032 - published 5 March 2015 Show/Hide Abstract
Abstract: Agents involved in a conflicting claims problem may be concerned with the proportion of their claims that is satisfied, or with the total amount they get. In order to relate both perspectives, we associate to each conflicting claims problem a bargaining-in-proportions set. Then, we obtain a correspondence between classical bargaining solutions and usual claims rules. In particular, we show that the constrained equal losses, the truncated constrained equal losses and the contested garment (Babylonian Talmud) rules can be obtained throughout the Nash bargaining solution.
Games2015, 6(1), 2-31; doi:10.3390/g6010002 - published 9 January 2015 Show/Hide Abstract
Abstract: We study the structure of the rest points of signaling games and their dynamic behavior under selection-mutation dynamics by taking the case of three signals as our canonical example. Many rest points of the replicator dynamics of signaling games are not isolated and, therefore, not robust under perturbations. However, some of them attract open sets of initial conditions. We prove the existence of certain rest points of the selection-mutation dynamics close to Nash equilibria of the signaling game and show that all but the perturbed rest points close to strict Nash equilibria are dynamically unstable. This is an important result for the evolution of signaling behavior, since it shows that the second-order forces that are governed by mutation can increase the chances of successful signaling.
Games2014, 5(4), 234-256; doi:10.3390/g5040234 - published 14 November 2014 Show/Hide Abstract
Abstract: We investigate experimentally whether the extent of conditional cooperation in public good games depends on the marginal per capita return (MPCR) to the public good and type of game. The MPCR is varied from 0.2 to 0.4 to 0.8. The ‘standard’ game, in which three players contribute before a follower, is compared with a leader-follower game, in which one player leads and three follow. Even though we observe less conditional cooperation for an MPCR of 0.2, the prevalence of conditional cooperation remains relatively stable to changes in the MPCR and game timing. In contrast, the level of MPCR has a strong effect on unconditional contributions. Our results highlight the critical role played by leaders in a public good game.
Games2014, 5(4), 204-233; doi:10.3390/g5040204 - published 30 October 2014 Show/Hide Abstract
Abstract: This paper attacks a problem like the one addressed in an earlier work (Potthoff, 2013) but is more mathematical. The setting is one where an election is to choose a single winner from m (> 2) candidates, it is postulated that voters have knowledge of the preference profile of the electorate, and preference cycles are limited. Both papers devise voting systems whose two key goals are to select a Condorcet winner (if one exists) and to resist manipulation. These systems entail equilibrium strategies where everyone votes sincerely, no group of voters sharing the same preference ordering can gain by deviating given that no one else deviates, and the Condorcet candidate wins. The present paper uses two unusual ballot types. One asks voters to rank the candidates with respect both to their own preferences and to their discerned order of preference of the entire electorate. The other just asks voters for their own preference ranks plus approval votes. Novel mathematical elements distinguish this paper. Its Condorcet completion methods examine all candidate triples, sometimes analyze loop(s) of some of those triples, and order candidates in a set by first determining the last-place candidate. Its non-manipulability proofs involve mathematical induction on m.