Tournament games and positive tournaments
From MaRDI portal
Publication:4326540
DOI10.1002/jgt.3190190208zbMath0823.90142OpenAlexW2045793488MaRDI QIDQ4326540
Jennifer K. Ryan, David C. Fisher
Publication date: 20 March 1995
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190190208
Related Items (28)
Pushing vertices in digraphs without long induced cycles ⋮ Extending tournament solutions ⋮ Probabilities within optimal strategies for tournament games ⋮ On the tradeoff between efficiency and strategyproofness ⋮ On homomorphisms of oriented graphs with respect to the push operation ⋮ Minimal extending sets in tournaments ⋮ Tournament solutions based on cooperative game theory ⋮ On oriented cliques with respect to push operation ⋮ An analytical and experimental comparison of maximal lottery schemes ⋮ Query complexity of tournament solutions ⋮ Cops and robber on oriented graphs with respect to push operation ⋮ Skew-adjacency matrices of tournaments with bounded principal minors ⋮ Minimal stable sets in tournaments ⋮ On the structure of stable tournament solutions ⋮ Representation in majority tournaments ⋮ Pushable chromatic number of graphs with degree constraints ⋮ The minimal covering set in large tournaments ⋮ Minimal retentive sets in tournaments ⋮ A computational analysis of the tournament equilibrium set ⋮ Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture ⋮ Pick's inequality and tournaments ⋮ Robust bounds on choosing from large tournaments ⋮ Optimal strategies for random tournament games ⋮ Tournament games and Condorcet voting ⋮ Margin of victory for tournament solutions ⋮ Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games ⋮ Robust bounds on choosing from large tournaments ⋮ Bounds on the disparity and separation of tournament solutions
Cites Work
This page was built for publication: Tournament games and positive tournaments
