One-sided markets with externalities
From MaRDI portal
Cites work
- A complexity approach for core-selecting exchange under conditionally lexicographic preferences
- Almost envy-free allocations with connected bundles
- Computing approximate Nash equilibria in polymatrix games
- Distributed fair allocation of indivisible goods
- Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
- Efficient equilibria in polymatrix coordination games
- Fair Allocation of Indivisible Goods
- Friendship and stable matching
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 1973378 (Why is no real title available?)
- scientific article; zbMATH DE number 3326981 (Why is no real title available?)
- scientific article; zbMATH DE number 2243403 (Why is no real title available?)
- Integer Linear Programs and Local Search for Max-Cut
- Local matching dynamics in social networks
- Maximin share allocations on cycles
- Modified Schelling games
- On cores and indivisibility
- On minmax theorems for multiplayer games
- Random Paths to Stability in Two-Sided Matching
- Schelling games on graphs
- Schelling segregation with strategic agents
- Settling the complexity of local max-cut (almost) completely
- Simple Local Search Problems that are Hard to Solve
- Splitting necklaces
- Topological Influence and Locality in Swap Schelling Games.
- Twenty lectures on algorithmic game theory
- Welfare guarantees in Schelling segregation
This page was built for publication: One-sided markets with externalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021367)
