The following pages link to The assignment game. I: The core (Q2552452):
Displaying 50 items.
- Graph Stabilization: A Survey (Q4689625) (← links)
- QUASI-ASSIGNMENT COOPERATIVE GAMES (Q4797301) (← links)
- Convergence of the Core in Assignment Markets (Q4971365) (← links)
- Competitive Equilibrium and Trading Networks: A Network Flow Approach (Q4994146) (← links)
- Matching While Learning (Q4994180) (← links)
- (Q5002762) (← links)
- Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions (Q5031010) (← links)
- (Q5053286) (← links)
- Networks, Communication and Hierarchy: Applications to Cooperative Games (Q5057948) (← links)
- Spatio-Temporal Pricing for Ridesharing Platforms (Q5080659) (← links)
- Cooperative Games (Von Neumann-Morgenstern Stable Sets) (Q5149725) (← links)
- Principal-Agent Models (Q5149738) (← links)
- Two-Sided Matching Models (Q5150290) (← links)
- Understanding the Other Through Social Roles (Q5245035) (← links)
- A Solution Concept Related to “Bounded Rationality” for some Two-Echelon Models (Q5384715) (← links)
- Substitution, Complementarity, and Stability (Q5384717) (← links)
- Envy-free pricing in multi-item markets (Q5501961) (← links)
- (Q5743443) (← links)
- Fully Polynomial-Time Approximation Schemes for Fair Rent Division (Q5868945) (← links)
- Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium (Q5882229) (← links)
- Finding nucleolus of flow game (Q5896983) (← links)
- An incentive compatible, efficient market for air traffic flow management (Q5918109) (← links)
- Affinely representable lattices, stable matchings, and choice functions (Q5918423) (← links)
- Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)
- Job matching and coalition formation with utility or disutility of co-workers (Q5928237) (← links)
- On the core of transportation games (Q5932334) (← links)
- Auction protocols for decentralized scheduling (Q5938627) (← links)
- Efficiency and stability of probabilistic assignments in marriage problems (Q5964688) (← links)
- Transportation interval situations and related games (Q5964848) (← links)
- Review of the theory of stable matchings and contract systems (Q6039790) (← links)
- Stable matching under forward‐induction reasoning (Q6059561) (← links)
- On the revealed preference analysis of stable aggregate matchings (Q6059562) (← links)
- When Walras meets Vickrey (Q6059566) (← links)
- Constrained-optimal tradewise-stable outcomes in the one-sided assignment game: a solution concept weaker than the core (Q6063093) (← links)
- Walrasian equilibria from an optimization perspective: A guide to the literature (Q6076488) (← links)
- On Groves mechanisms for costly inclusion (Q6076923) (← links)
- Comparison of four mechanisms for request exchange in collaborative transportation (Q6082287) (← links)
- REDUCING RECOMMENDATION INEQUALITY VIA TWO‐SIDED MATCHING: A FIELD EXPERIMENT OF ONLINE DATING (Q6088692) (← links)
- Matching markets with middlemen under transferable utility (Q6103197) (← links)
- Informational hold up and intermediaries (Q6105131) (← links)
- Characterization of TU games with stable cores by nested balancedness (Q6120896) (← links)
- Stable outcomes in simple cooperative games (Q6121899) (← links)
- Housing markets since Shapley and Scarf (Q6121908) (← links)
- Approximate core allocations for edge cover games (Q6122606) (← links)
- Choosing sides in a two-sided matching market (Q6136270) (← links)
- Stable sharing (Q6176743) (← links)
- Designing rotation programs: limits and possibilities (Q6188667) (← links)
- Robust matching for teams (Q6191110) (← links)
- Stability and convergence in matching processes for shared mobility systems (Q6195263) (← links)
- Expectational equilibria in many-to-one matching models with contracts (Q6203356) (← links)
