Pages that link to "Item:Q2828226"
From MaRDI portal
The following pages link to The complexity of the nucleolus in compact games (Q2828226):
Displaying 15 items.
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- The \({\mathcal B}\)-nucleolus of TU-games (Q1268656) (← links)
- Computing the nucleolus of some combinatorially-structured games. (Q1587940) (← links)
- The complexity of egalitarian mechanisms for linear programming games (Q1667178) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting (Q2321294) (← links)
- A heuristic procedure for computing the nucleolus (Q2329720) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- Strongly essential coalitions and the nucleolus of peer group games (Q2572447) (← links)
- Characteristic function games with restricted agent interactions: core-stability and coalition structures (Q2634475) (← links)
- On the Core and <i>f</i>-Nucleolus of Flow Games (Q3169076) (← links)
- On the Complexity of Cooperative Solution Concepts (Q4302588) (← links)
- Non-unique games over compact groups and orientation estimation in cryo-EM (Q5000617) (← links)
- Finding nucleolus of flow game (Q5896983) (← links)
