Relaxed sequencing games have a nonempty core
From MaRDI portal
Recommendations
Cited in
(21)- On the balancedness of relaxed sequencing games
- Multiple-machine scheduling with learning effects and cooperative games
- Shapley value for parallel machine sequencing situation without initial order
- On the convexity of step out-step in sequencing games
- Cost allocation in rescheduling with machine unavailable period
- Crowding games are sequentially solvable
- Games in sequencing situations with externalities
- Open shop scheduling games
- Sequencing situations and games with non-linear cost functions under optimal order consistency
- On interactive sequencing situations with exponential cost functions
- Compensation rules for multi-stage sequencing games
- Partitioning sequencing situations and games
- Job scheduling, cooperation, and control
- Step out-step in sequencing games
- A rescheduling and cost allocation mechanism for delayed arrivals
- Batch sequencing and cooperation
- scientific article; zbMATH DE number 764439 (Why is no real title available?)
- Multi-stage sequencing situations
- The stable gain splitting rule for sequencing situations
- Queueing games with an endogenous number of machines
- A bargaining game for implementing the equal gain splitting rule in sequencing situations
This page was built for publication: Relaxed sequencing games have a nonempty core
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5438522)
