On tournament games and positive tournaments
This thesis deals with tournament games and positive tournaments. Given an n-node tournament T, a tournament game on T is as follows: Two players independently pick a node of T. If both picked the same node, the game is tied. Otherwise, the player whose node is at the tail of the arc connecting the...
Saved in:
Main Author: | de Armas, Roderico A. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2003
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/3077 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/9915/viewcontent/TG03496_F_Partial.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Achievement and avoidance games for connected graphs having a vertex of degree N
by: Antonio, Vilma, et al.
Published: (1994) -
On some properties of cyclic tournaments
by: Remoto, Shirlee Ribaya
Published: (1994) -
On even tournaments whose automorphism groups contain regular subgroups
by: Torres, Ernesto C., Jr.
Published: (1994) -
On isomorphic, nonisomorphic and the number of tournaments from three tournament construction algorithms
by: Alvarez, Ryan T.
Published: (1999) -
On the games nim, sprouts and domineering (with computer program)
by: Azarraga, Julius Rex Q., et al.
Published: (1995)