Weighted nucleoli and dually essential coalitions

We consider linearly weighted versions of the least core and the (pre)nucleolus and investigate the reduction possibilities in their computation. We slightly extend some well-known related results and establish their counterparts by using the dual game. Our main results imply, for example, that if the core of the game is not empty, all dually inessential coalitions (which can be weakly minorized by a partition in the dual game) can be ignored when we compute the per-capita least core and the per-capita (pre)nucleolus from the dual game. This could lead to the design of polynomial time algorithms for the per-capita (and other monotone nondecreasingly weighted versions of the) least core and the (pre)nucleolus in specific classes of balanced games with polynomial many dually esential coalitions.

An Elementary Core Equivalence Theorem in a Countable Economy

We consider an infinite exchange economy with countably many traders, which can be regarded as a natural extension of finite exchange economies to an infinite one. In our countable economy the core defined in the traditional manner would be empty. To avoid this unwanted situation we have to strengthen the notion of “improves upon”. We will achieve this based on the idea that forming coalitions involve costs.

What makes ISAF s/tick: An investigation of the politics of coalition burden-sharing

This paper is interested in conceptualising the often raised issue of over- and under-contributing in coalition operations; that of how and why members of complex coalitions2 may be punching above and below their weight, respectively. To this end, the first section presents a parsimonious baseline assumption regarding what variables may fundamentally inform coalition burden-sharing, to subsequently discuss how much each of these are found to play a role in the Afghanistan context. The second section elaborates on this by assessing the perception and the interpretation of threats by coalition member countries, related to Afghanistan, as this pertains to prioritising other variables within the scheme outlined in the previous section. The third and fourth sections then proceed to examine and further enrich the existing literature on coalition burden-sharing, and provide further insights regarding the operations of the International Security Assistance Force–Afghanistan, and regarding ISAF member-country decisionmaking; the objective here is to generate further refined assumptions, that can permit a preliminary assessment of the phenomenon of uneven burden-sharing in ISAF, complementing the initial baseline expectations.

Transferable Utility Games with Uncertainty

We introduce the concept of a TUU-game, a transferable utility game with uncertainty. In a TUU-game there is uncertainty regarding the payoffs of coalitions. One out of a finite number of states of nature materializes and conditional on the state, the players are involved in a particular transferable utility game. We consider the case without ex ante commitment possibilities and propose the Weak Sequential Core as a solution concept. We characterize the Weak Sequential Core and show that it is non-empty if all ex post TUgames are convex.

Transferable Utility Games with Uncertainty

We introduce the concept of a TUU-game, a transferableutilitygame with uncertainty. In a TUU-game there is uncertainty regarding the payoffs of coalitions. One out of a finite number of states of nature materializes and conditional on the state, the players are involved in a particular transferableutilitygame. We consider the case without ex ante commitment possibilities and propose the Weak Sequential Core as a solution concept. We characterize the Weak Sequential Core and show that it is non-empty if all ex post TU-games are convex.

Lexicographic allocations and extreme core payoffs: the case of assignment games

We consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We first investigate the general relationship between these allocations and obtain two hierarchies on the class of balanced games. Secondly, we focus on assignment games and sharpen some of these general relationship. Our main result is the coincidence of the sets of lemarals (vectors of lexicographic maxima over the set of dual coalitionally rational payoff vectors), lemacols (vectors of lexicographic maxima over the core) and extreme core points. As byproducts, we show that, similarly to the core and the coalitionally rational payoff set, also the dual coalitionally rational payoff set of an assignment game is determined by the individual and mixed-pair coalitions, and present an efficient and elementary way to compute these basic dual coalitional values. This provides a way to compute the Alexia value (the average of all lemacols) with no need to obtain the whole coalitional function of the dual assignment game.