Name
Abstract | ||
|---|---|---|
We study m-sequencing games, which were introduced by [Hamers, H., Klijn, F., Suijs, J., (1999). On the balancedness of multiple machine sequencing games. European Journal of Operational Research 119, 678–691]. We answer the open question whether all these games are balanced in the negative. We do so, by an example of a 3-sequencing situation with 5 jobs, whose associated 3-sequencing game has an empty core. The counterexample finds its basis in an inconsistency in [Hamers et al., ibid], which was probably overlooked by the authors. This observation demands for a detailed reconsideration of their proofs.1We will not deal with their noncooperative approach.1 |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.ejor.2005.03.031 | European Journal of Operational Research |
Keywords | Field | DocType |
Game theory,Cooperative games,Sequencing situations | Mathematical economics,Mathematical optimization,Computer science,Mathematical proof,Game theory,Artificial intelligence,Counterexample | Journal |
Volume | Issue | ISSN |
174 | 3 | 0377-2217 |
Citations | PageRank | References |
1 | 0.37 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Slikker | 1 | 191 | 46.31 |