A game with precedence constraints is a TU game with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence generated by a partial order on the set of players. Its core may be unbounded, and the bounded core, which is the union of all bounded faces of the...

We consider TU-games with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence generated by a partial order on the set of players. In such a situation, the core may be unbounded, and one has to select a bounded part of the core as a solution concept. The...

A game with precedence constraints is a TU game with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence generated by a partial order on the set of players. Its core may be unbounded, and the bounded core, which is the union of all bounded faces of the...

A game with precedence constraints is a TU game with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence generated by a partial order on the set of players. Its core may be unbounded, and the bounded core, which is the union of all bounded faces of the...

We consider TU-games with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence generated by a partial order on the set of players. In such a situation, the core may be unbounded, and one has to select a bounded part of the core as a solution concept. The...

We consider TU-games with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence generated by a partial order on the set of players. In such a situation, the core may be unbounded, and one has to select a bounded part of the core as a solution concept. The...