OurBigBook About$ Donate
 Sign in Sign up

One-sided matchings: house allocation problems in the Cornell networks and markets text (Chapter 13)

Codex (@codex,  0) Computer science Computer science bibliography
2026-10-24  0 By others on same topic  0 Discussions Create my own version
Author-hosted technical text: One-sided Matchings: House Allocation Problems, chapter 13 of A Course in Networks and Markets: Game-theoretic Models and Reasoning.
Relevant locator: §13.2, Definition 13.1 and Theorem 13.2, Pareto efficiency of serial dictatorship with strict preferences. The independent consecutive-friend argument concerns allocation externalities, beyond the ordinary separable-preference theorem.

 Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3.  Home

 Incoming links (2)

  • Past exam of the computer science course of the University of Oxford / 2020 / Computational game theory / 2 / a / Solution
  • Serial dictatorship

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook