Sequencing games (Q1121813): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The \(\tau\)-value, the core and semiconvex games / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5817872 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5817870 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cores of convex games / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3921032 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Permutation games: Another class of totally balanced games / rank | |||
Normal rank | |||
Revision as of 14:41, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sequencing games |
scientific article |
Statements
Sequencing games (English)
0 references
1989
0 references
Sequencing situations with linear cost functions are considered. Cooperative game theory is applied to analyze these situations. The convexity of these games is verified, and the Shapley values are determined.
0 references
queueing
0 references
Sequencing situations
0 references
linear cost functions
0 references
Shapley values
0 references
