~/talk

Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets

Talkat ITCS 2021 · 2021-01-06..01-08
links:none on file
links:none on file
slides:none on file

Shows that computing exact HZ equilibria requires nonlinear fixed points by giving a unique irrational 4×4 instance (root of 17) and proves exact computation lies in FIXP membership via a Brouwer straight-line program, while an epsilon notion with exact fractional matching is in PPAD for approximate equilibria by polynomial continuity. Gives a combinatorial strongly polynomial algorithm for the special case of two-valued utilities algorithm and leaves hardness and the three-valued case open.

AI-written summary · about

  1. 0:00Introduction
  2. 0:20Market mechanism properties
  3. 1:41Fractional perfect matching
  4. 4:02Fisher market setup
  5. 7:22Complexity and open questions
  6. 9:04Two-valued utility results
  7. 10:45Complexity class membership
  8. 13:20Algorithm for two-valued case
  9. 17:51Theoretical foundations
  10. 20:15Irrationality in equilibrium
  11. 23:46Membership in FIXP
  12. 26:55Approximate equilibria
  13. 29:59Conclusion and future work
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.