~/talk

Fairness and Efficiency for Probabilistic Allocations with Endowments

Talkat Matching and Objectives · on Friday, 2019-09-06
links:none on file
slides:none on file

Proposes a concrete fairness rule called no justified envy that tolerates envy only when swapping would violate the other agent’s endowment, proves existence of fractional allocations that are Pareto‑optimal and individually rational under concave preferences, and shows Walrasian prices can fail (a 3‑agent counterexample with two objects). Tools: construction of price‑dependent income functions, utilitarian weight maximization and the KKM lemma (fixed‑point style). Results extend to convex policy constraints and expected‑utility domains.

AI-written summary · about

  1. 0:00Introduction
  2. 1:23Why Endowments
  3. 6:27Fairness
  4. 10:19Pareto Optimal
  5. 15:25Property Rights
  6. 17:44Budgets
  7. 24:39Definitions
  8. 33:09Contrapositive
  9. 34:34Theorems
  10. 40:47Proof
~/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.