The following pages link to The assignment game. I: The core (Q2552452):
Displaying 50 items.
- Hyperadditive games and applications to networks or matching problems (Q1995312) (← links)
- The importance of memory for price discovery in decentralized markets (Q1995460) (← links)
- Learning from like-minded people (Q1995480) (← links)
- A stochastic approach to approximate values in cooperative games (Q2001459) (← links)
- A note on assignment games with the same nucleolus (Q2001861) (← links)
- Facets of the cone of totally balanced games (Q2009181) (← links)
- Bargaining in dynamic markets (Q2013334) (← links)
- Coexistence of long-term and short-term contracts (Q2016226) (← links)
- A competitive partnership formation process (Q2016227) (← links)
- Labor market matching with ensuing competitive externalities in large economies (Q2019341) (← links)
- Efficiency, stability, and commitment in senior level job matching markets (Q2025051) (← links)
- Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants (Q2027040) (← links)
- Stable matching and protocol-free equilibrium (Q2031196) (← links)
- Valuation monotonicity, fairness and stability in assignment problems (Q2044987) (← links)
- Stability in sequential matching with incomplete information (Q2049497) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- Gabrielle Demange (Q2064131) (← links)
- Matching markets and cultural selection (Q2070745) (← links)
- Matching with ownership (Q2075636) (← links)
- Stable cores in information graph games (Q2078082) (← links)
- The general graph matching game: approximate core (Q2078093) (← links)
- Shapley value for TU-games with multiple memberships and externalities (Q2082785) (← links)
- On the population monotonicity of independent set games (Q2084006) (← links)
- The core of a strategic game (Q2098982) (← links)
- Local stability constraints (Q2099323) (← links)
- Axioms for the optimal stable rules and fair-division rules in a multiple-partners job market (Q2100655) (← links)
- Bipartite choices (Q2105872) (← links)
- Deferred acceptance algorithm with retrade (Q2108764) (← links)
- Population monotonicity in matching games (Q2136163) (← links)
- Decision-making with reference information (Q2154380) (← links)
- Recent studies of agent incentives in Internet resource allocation and pricing (Q2159522) (← links)
- Relative entropy and envy-free allocation (Q2171250) (← links)
- Inefficient sorting under output sharing (Q2173113) (← links)
- A speedy auction using approximated bidders' preferences (Q2173118) (← links)
- Pre-matching gambles (Q2173390) (← links)
- Efficient computation of the Shapley value for large-scale linear production games (Q2177801) (← links)
- Assortative multisided assignment games: the extreme core points (Q2178011) (← links)
- On the non-existence of stable matches with incomplete information (Q2178025) (← links)
- Allocating costs in set covering problems (Q2178140) (← links)
- Market sentiments and convergence dynamics in decentralized assignment economies (Q2178648) (← links)
- Comparative statics in markets for indivisible goods (Q2201704) (← links)
- Networks, frictions, and price dispersion (Q2212770) (← links)
- Does it make sense to analyse a two-sided market as a multi-choice game? (Q2241239) (← links)
- Introduction to computer science and economic theory (Q2253830) (← links)
- Bargaining dynamics in exchange networks (Q2253845) (← links)
- Truthful unit-demand auctions with budgets revisited (Q2257295) (← links)
- An axiomatization of the nucleolus of assignment markets (Q2259410) (← links)
- Two-sided market situations with existing contracts (Q2268367) (← links)
- Tick size, price grids and market performance: stable matches as a model of market dynamics and equilibrium (Q2278907) (← links)
- Downstream competition and upstream labor market matching (Q2280043) (← links)
