Tournament games and positive tournaments
From MaRDI portal
Publication:4326540
DOI10.1002/jgt.3190190208zbMath0823.90142MaRDI 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
Unnamed Item, Robust bounds on choosing from large tournaments, Robust bounds on choosing from large tournaments, Minimal retentive sets in tournaments, Minimal stable sets in tournaments, The minimal covering set in large tournaments, A computational analysis of the tournament equilibrium set, Probabilities within optimal strategies for tournament games, Pushing vertices in digraphs without long induced cycles, Extending tournament solutions, On the tradeoff between efficiency and strategyproofness, On the structure of stable tournament solutions, Pick's inequality and tournaments, Optimal strategies for random tournament games, Tournament games and Condorcet voting, Representation in majority tournaments, Margin of victory for tournament solutions, Tournament solutions based on cooperative game theory, Pushable chromatic number of graphs with degree constraints, Bounds on the disparity and separation of tournament solutions, On homomorphisms of oriented graphs with respect to the push operation, Minimal extending sets in tournaments, On oriented cliques with respect to push operation, Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games, An analytical and experimental comparison of maximal lottery schemes
Cites Work
