Pages that link to "Item:Q1414387"

The following pages link to On the computation of the nucleolus of a cooperative game (Q1414387):

Displaying 21 items.

• Sharing costs in highways: a game theoretic approach (Q257250) (← links)
• Finding the nucleoli of large cooperative games (Q320842) (← links)
• Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← links)
• On Chinese postman games where residents of each road pay the cost of their road (Q550185) (← links)
• Computing solutions for matching games (Q662281) (← links)
• Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
• A general characterization for non-balanced games in terms of \(U\)-cycles (Q933515) (← links)
• Computing the cores of strategic games with punishment-dominance relations (Q933749) (← links)
• Traveling salesman games with the Monge property (Q1827808) (← links)
• Approximate nucleolus-based revenue sharing in airline alliances (Q1926764) (← links)
• Bargaining dynamics in exchange networks (Q2253845) (← links)
• Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
• Computing an element in the lexicographic kernel of a game (Q2474551) (← links)
• Common mistakes in computing the nucleolus (Q2629740) (← links)
• On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
• The least square B-nucleolus for fuzzy cooperative games (Q2988439) (← links)
• Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation (Q4971567) (← links)
• Algorithmic Cost Allocation Games: Theory and Applications (Q5176374) (← links)
• A COMPUTATIONAL APPROACH TO THE COINCIDENCE OF EGALITARIAN SOLUTIONS FOR COST-SHARING GAMES (Q5470122) (← links)
• Finding nucleolus of flow game (Q5896983) (← links)
• Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)