The following pages link to Dominance Solvable Voting Schemes (Q3853384):
Displayed 50 items.
- Formal versus informal legislative bargaining (Q263365) (← links)
- On the structure of weakly acyclic games (Q372989) (← links)
- A theory of iterative choice in lists (Q406253) (← links)
- Total tightness implies Nash-solvability for three-person game forms (Q408181) (← links)
- Cournot tâtonnement and dominance solvability in finite games (Q423893) (← links)
- A foundation for strategic agenda voting (Q485757) (← links)
- Dominance-solvable common-value large auctions (Q645636) (← links)
- On the equivalence of weak dominance and sequential best response (Q705862) (← links)
- Two-person pairwise solvable games (Q776846) (← links)
- Dominance solvability and Cournot stability (Q794934) (← links)
- On the inconsistency of certain axioms on solution concepts for non- cooperative games (Q798573) (← links)
- Implementability via protective equilibria (Q800203) (← links)
- Aggregation of preferences: The fuzzy case (Q811309) (← links)
- Strong and coalition-proof political equilibria under plurality and runoff rule (Q869240) (← links)
- Symmetric bidding in second-price, common-value auctions (Q899767) (← links)
- On dominance solvable auctions in the general symmetric model (Q899875) (← links)
- Subgame perfect implementation: A necessary and almost sufficient condition (Q909551) (← links)
- On the order of eliminating dominated strategies (Q911490) (← links)
- Cyclic tournaments and cooperative majority voting: A solution (Q912750) (← links)
- Acyclic, or totally tight, two-person game forms: characterization and main properties (Q966009) (← links)
- Dominance solvability of dynamic bargaining games (Q971896) (← links)
- The welfare consequences of strategic voting in two commonly used parliamentary agendas (Q995675) (← links)
- Multi-stage voting, sequential elimination and Condorcet consistency (Q1017796) (← links)
- Iterative elimination of weakly dominated strategies in binary voting agendas with sequential voting (Q1024769) (← links)
- Dominance elimination procedures on finite alternative games (Q1052938) (← links)
- Dimensions of election procedures: Analyses and comparisons (Q1055323) (← links)
- Research in decision theory: A personal perspective (Q1056649) (← links)
- On enforcing socially best alternatives of binary group decision rules (Q1081509) (← links)
- Choosing from a tournament (Q1089228) (← links)
- The Bayesian foundations of solution concepts of games (Q1108208) (← links)
- Stable equilibria and forward induction (Q1122514) (← links)
- Implementing efficient, anonymous and neutral social choice functions (Q1147612) (← links)
- Prudence versus sophistication in voting strategy (Q1159118) (← links)
- Social systems analysis (Q1161691) (← links)
- Dominance solvable games and trees (Q1162268) (← links)
- Implementation via backward induction (Q1183696) (← links)
- A social choice rule and its implementation in perfect equilibrium (Q1183700) (← links)
- Implementing alternative voting in kingmaker trees (Q1196625) (← links)
- Implementing a public project and distributing its cost (Q1196663) (← links)
- ``Cautious'' utility maximation and iterated weak dominance (Q1196700) (← links)
- To fight or not to fight? That is the question (Q1278554) (← links)
- A general solution to King Solomon's dilemma (Q1288243) (← links)
- Divide the dollar: Three solutions and extensions (Q1332719) (← links)
- Order independence for iterated weak dominance (Q1357404) (← links)
- On rationalizability in extensive games (Q1367906) (← links)
- Maximum games, dominance solvability, and coordination (Q1566894) (← links)
- Chess-like games are dominance solvable in at most two steps (Q1593744) (← links)
- Beyond the Spanish MIR with consent: (hidden) cooperation and coordination in matching (Q1651221) (← links)
- Inspired and inspiring: Hervé Moulin and the discovery of the beauty contest game (Q1680118) (← links)
- Cooperation in games and epistemic readings of independence-friendly sentences (Q1689283) (← links)