The following pages link to Jun Wako (Q176926):
Displayed 10 items.
- Coalition-proof Nash allocation in a barter game with multiple indivisible goods (Q557955) (← links)
- A note on the strong core of a market with indivisible goods (Q1057768) (← links)
- A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games (Q1959733) (← links)
- Another proof that assignment games have singleton cores only if multiple optimal matchings exist (Q2505528) (← links)
- Strong Core and Competitive Equilibria of an Exchange Market with Indivisible Goods (Q3986366) (← links)
- TWO EXAMPLES IN A MARKET WITH TWO TYPES OF INDIVISIBLE GOOD (Q4407202) (← links)
- (Q4546332) (← links)
- Cooperative Games (Von Neumann-Morgenstern Stable Sets) (Q5149725) (← links)
- On Houseswapping, the Strict Core, Segmentation, and Linear Programming (Q5704202) (← links)
- On the Shapley-Scarf economy: The case of multiple types of indivisible goods (Q5931981) (← links)