Pages that link to "Item:Q1913575"

The following pages link to Core theory for multiple-sided assignment games (Q1913575):

Displaying 20 items.

• The maximum and the addition of assignment games (Q636018) (← links)
• Characterization of cores of assignment games (Q805509) (← links)
• The Shapley value of exact assignment games (Q878169) (← links)
• A survey on assignment markets (Q908179) (← links)
• The core of an \(m\)-sided assignment game (Q1198183) (← links)
• The supplier-firm-buyer game and its \(m\)-sided generalization (Q1277466) (← links)
• The core of a further \(m\)-sided assignment game (Q1278740) (← links)
• The \textit{ex ante} incentive compatible core of the assignment game. (Q1431786) (← links)
• Shapley's conjecture on the cores of abstract market games (Q1651297) (← links)
• Three little-known and yet still significant contributions of Lloyd Shapley (Q1651308) (← links)
• \(k\)-sided permutation games and multiprices of equilibrium (Q1876149) (← links)
• Analysis of the core of multisided Böhm-Bawerk assignment markets (Q1948533) (← links)
• A note on the inclusion of the kernel in the core of the bilateral assignment game (Q1972576) (← links)
• Assortative multisided assignment games: the extreme core points (Q2178011) (← links)
• Multi-sided assignment games on \(m\)-partite graphs (Q2288857) (← links)
• Monotonic core allocation paths for assignment games (Q2296028) (← links)
• A note on the relationship between the core and stable sets in three-sided markets (Q2329695) (← links)
• Convergence of the approximate cores to the aspiration core in partitioning games (Q2355013) (← links)
• Another proof that assignment games have singleton cores only if multiple optimal matchings exist (Q2505528) (← links)
• Constrained-optimal tradewise-stable outcomes in the one-sided assignment game: a solution concept weaker than the core (Q6063093) (← links)