We consider bin packing games introduced by Faigle and Kern (1993) and we restrict ourselves to the subclass of games for which all bins have unit capacity and all items are larger than 1/3. We adopt the taxation model of Faigle and Kern and we prove that for a tax-rate of ɛ=sk<Subscript>7/1</Subscript> the ɛ-core...</subscript>

The lexicographic kernel of a game lexicographically maximizes the surplusses s <Subscript> ij </Subscript> (rather than the excesses as would the nucleolus) and is contained in both the least core and the kernel. We show that an element in the lexicographic kernel can be computed efficiently, provided we can...</subscript>

This paper presents an extension of the traditional bankruptcy problem. In a resource allocation problem there is a common-pool resource, which needs to be divided among agents. Each agent is characterized by a claim on this pool and an individual linear monetary reward function for assigned...

We consider a situation in which a group of banks consider connecting their Automated Teller Machines (ATMs) in a network, so that the banks’ customers may use ATMs of any bank in the network. The problem studied is that of allocating the total transaction costs arising in the network, among...

Curiel, Potters, Prasad, Tijs and Veltman (1993) introduced component additive games which are cooperative TU games that arise by imposing an order on the player set. Further, they introduced the β-rule which allocates a core element to each component additive game. In this paper we consider...

Neighbor games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, the class of neighbor games is the intersection of the class of assignment games (Shapley and Shubik (1972)) and the class of component...

In this paper we consider a wireless network consisting of various nodes, where transmissions are regulated by the slotted ALOHA protocol. Nodes using the protocol behave autonomously, and decide at random whether to transmit in a particular time slot. Simultaneous transmissions by multiple...

This paper shows that some classes of relaxed sequencing games, which arise from the class of sequencing games as introduced in Curiel, Pederzoli, Tijs (1989), are balanced. Copyright Springer-Verlag Berlin Heidelberg 2003

<Para ID="Par1">The core cover of a TU-game is a superset of the core and equals the convex hull of its larginal vectors. A larginal vector corresponds to an ordering of the players and describes the efficient payoff vector giving the first players in the ordering their utopia demand as long as it is still...</para>