Dutta's minimal covering set and Shapley's saddles
From MaRDI portal
Publication:1815205
DOI10.1006/JETH.1996.0085zbMATH Open0859.90124OpenAlexW1992958064MaRDI QIDQ1815205FDOQ1815205
Publication date: 7 November 1996
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jeth.1996.0085
Cited In (18)
- Extending tournament solutions
- Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games
- Minimal extending sets in tournaments
- Polyequilibrium
- Minimal stable sets in tournaments
- Minimal covering set solutions
- Title not available (Why is that?)
- An ordinal minimax theorem
- Online ascending auctions for gradually expiring items
- Mixed refinements of Shapley's saddles and weak tournaments
- Computing the minimal covering set
- Minimal retentive sets in tournaments
- Distributive politics and electoral competition
- The computational complexity of weak saddles
- Choosing from a weighted tournament
- A new old solution for weak tournaments
- Query complexity of tournament solutions
- Bounds on the disparity and separation of tournament solutions
Recommendations
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)