Dutta's minimal covering set and Shapley's saddles
From MaRDI portal
Publication:1815205
Recommendations
Cited in
(18)- An ordinal minimax theorem
- The computational complexity of weak saddles
- Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games
- Distributive politics and electoral competition
- Computing the minimal covering set
- Choosing from a weighted tournament
- Extending tournament solutions
- Bounds on the disparity and separation of tournament solutions
- A new old solution for weak tournaments
- Minimal extending sets in tournaments
- Minimal covering set solutions
- Online ascending auctions for gradually expiring items
- scientific article; zbMATH DE number 4054461 (Why is no real title available?)
- Minimal retentive sets in tournaments
- Polyequilibrium
- Mixed refinements of Shapley's saddles and weak tournaments
- Query complexity of tournament solutions
- Minimal stable sets in tournaments
This page was built for publication: Dutta's minimal covering set and Shapley's saddles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815205)