Pages that link to "Item:Q2385112"

The following pages link to Component efficient solutions in line-graph games with applications (Q2385112):

Displayed 15 items.

• Balanced consistency and balanced cost reduction for sequencing problems (Q427519) ‎ (← links)
• Sequential sharing rules for river sharing problems (Q431811) ‎ (← links)
• Harsanyi power solutions for graph-restricted games (Q532510) ‎ (← links)
• The restricted core of games on distributive lattices: how to share benefits in a hierarchy (Q532527) ‎ (← links)
• Axiomatizations of two types of Shapley values for games on union closed systems (Q535178) ‎ (← links)
• Average tree solutions and the distribution of Harsanyi dividends (Q548073) ‎ (← links)
• The covering values for acyclic digraph games (Q647347) ‎ (← links)
• Compensations in the Shapley value and the compensation solutions for graph games (Q662276) ‎ (← links)
• Values for rooted-tree and sink-tree digraph games and sharing a river (Q708937) ‎ (← links)
• Weighted component fairness for forest games (Q712475) ‎ (← links)
• Ensuring the boundedness of the core of games with restricted cooperation (Q763107) ‎ (← links)
• Sharing a river among satiable agents (Q952762) ‎ (← links)
• Minimum cost spanning tree problems with groups (Q964464) ‎ (← links)
• Values for Markovian coalition processes (Q1762417) ‎ (← links)
• The core of games on ordered structures and graphs (Q5902298) ‎ (← links)