Pages that link to "Item:Q650525"
From MaRDI portal
The following pages link to On the complexity of core, kernel, and bargaining set (Q650525):
Displaying 21 items.
- Computing cooperative solution concepts in coalitional skill games (Q490424) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Path cooperative games (Q724748) (← links)
- On the use of binary decision diagrams for solving problems on simple games (Q1926964) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- Inconsistency-tolerant query answering for existential rules (Q2124462) (← links)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
- Cooperative games with overlapping coalitions: charting the tractability frontier (Q2321289) (← links)
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting (Q2321294) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- A cooperative game-theoretic approach to the social ridesharing problem (Q2407882) (← links)
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability (Q2409675) (← links)
- Solution concepts for games with general coalitional structure (Q2452810) (← links)
- Complexity of constructing solutions in the core based on synergies among coalitions (Q2457626) (← links)
- Characteristic function games with restricted agent interactions: core-stability and coalition structures (Q2634475) (← links)
- The complexity of the nucleolus in compact games (Q2828226) (← links)
- The Least-Core and Nucleolus of Path Cooperative Games (Q3196373) (← links)
- A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications (Q3392305) (← links)
- Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints (Q3588641) (← links)
- On the Complexity of Cooperative Solution Concepts (Q4302588) (← links)
- Complexity of computing the Shapley value in partition function form games (Q6488801) (← links)