Pages that link to "Item:Q1327070"
From MaRDI portal
The following pages link to An algorithm for finding the nucleolus of assignment games (Q1327070):
Displaying 45 items.
- Sharing costs in highways: a game theoretic approach (Q257250) (← links)
- Finding the nucleoli of large cooperative games (Q320842) (← links)
- The maximum and the addition of assignment games (Q636018) (← links)
- Assignment markets with the same core (Q645664) (← links)
- Computing solutions for matching games (Q662281) (← links)
- Computing the nucleolus of cyclic permutation games (Q707152) (← links)
- Path cooperative games (Q724748) (← links)
- On axiomatizations of the Shapley value for assignment games (Q745011) (← links)
- Evolutionary dynamics and equitable core selection in assignment games (Q891334) (← links)
- Computing the least-core and nucleolus for threshold cardinality matching games (Q897924) (← links)
- A survey on assignment markets (Q908179) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- On the dimension of the core of the assignment game (Q952778) (← links)
- A glove-market partitioned matrix related to the assignment game (Q1036587) (← links)
- The \({\mathcal B}\)-nucleolus of TU-games (Q1268656) (← links)
- On a variant of lexicographic multi-objective programming (Q1296132) (← links)
- Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
- Characterization sets for the nucleolus in balanced games (Q1694788) (← links)
- The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
- On the nucleolus of neighbor games (Q1869507) (← links)
- Core theory for multiple-sided assignment games (Q1913575) (← links)
- A simple procedure to compute the nucleolus of \(\Gamma\)-component additive games (Q1919115) (← links)
- The nucleolus and the core-center of multi-sided Böhm-Bawerk assignment markets (Q1935926) (← links)
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- A note on assignment games with the same nucleolus (Q2001861) (← links)
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks (Q2064296) (← links)
- The general graph matching game: approximate core (Q2078093) (← links)
- Population monotonicity in matching games (Q2136163) (← links)
- Finding and verifying the nucleolus of cooperative games (Q2235144) (← links)
- Does it make sense to analyse a two-sided market as a multi-choice game? (Q2241239) (← links)
- An axiomatization of the nucleolus of assignment markets (Q2259410) (← links)
- Weighted nucleoli and dually essential coalitions (Q2280044) (← links)
- Multi-sided assignment games on \(m\)-partite graphs (Q2288857) (← links)
- Network strength games: the core and the nucleolus (Q2297643) (← links)
- A procedure to compute the nucleolus of the assignment game (Q2450756) (← links)
- On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
- Arboricity games: the core and the nucleolus (Q2687037) (← links)
- The Complexity of the Nucleolus in Compact Games (Q2828226) (← links)
- Analytic solution for the nucleolus of a three-player cooperative game (Q3065628) (← links)
- The Least-Core and Nucleolus of Path Cooperative Games (Q3196373) (← links)
- ASSIGNMENT SITUATIONS WITH MULTIPLE OWNERSHIP AND THEIR GAMES (Q3395219) (← links)
- Stability and convergence in matching processes for shared mobility systems (Q6195263) (← links)
- Sensitivity of fair prices in assignment markets (Q6204151) (← links)
- The complexity of matching games: a survey (Q6488787) (← links)
