Pages that link to "Item:Q924627"
From MaRDI portal
The following pages link to Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627):
Displaying 12 items.
- Simple and three-valued simple minimum coloring games (Q343804) (← links)
- On the cores of games arising from integer edge covering functions of graphs (Q386434) (← links)
- The costs of conflict: a choice-theoretic, equilibrium analysis (Q500592) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
- A strategic justification of the constrained equal awards rule through a procedurally fair multilateral bargaining game (Q2021552) (← links)
- Minimum coloring problems with weakly perfect graphs (Q2149192) (← links)
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value (Q2173166) (← links)
- Monotonic stable solutions for minimum coloring games (Q2248763) (← links)
- Conflicts of interest during contact investigations: a game-theoretic analysis (Q2262710) (← links)
- FAIR ALLOCATION BASED ON TWO CRITERIA : A DEA GAME VIEW OF "ADD THEM UP AND DIVIDE BY TWO"(<Special Issue>Operations Research for Performance Evaluation) (Q3397569) (← links)
- Stable source connection and assignment problems as multi-period shortest path problems (Q6665449) (← links)