### Abstract

We mechanize proofs of several results from the matching with contracts literature, which generalize those of the classical two-sided matching scenarios that go by the name of stable marriage. Our focus is on game theoretic issues. Along the way we develop executable algorithms for computing optimal stable matches.

### License

BSD License

### Topics

- Mathematics/Games and economics

### Session Stable_Matching

- Sotomayor
- Basis
- Choice_Functions
- Contracts
- COP
- Bossiness
- Strategic

## Cite

×

Stable_Matching-AFP

    @article{Stable_Matching-AFP,
      author  = {Peter Gammie},
      title   = {Stable Matching},
      journal = {Archive of Formal Proofs},
      month   = {October},
      year    = {2016},
      note    = {\url{https://isa-afp.org/entries/Stable_Matching.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 20, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Oct 24, 2016 : Isabelle2016