1,970 research outputs found
Symmetry breaking in tournaments
We provide upper bounds for the determining number and the metric dimension of tournaments. A set of vertices S in V(T) is a determining set for a tournament T if every nontrivial automorphism of T moves at least one vertex of S, while S is a resolving set for T if every two distinct vertices in T have different distances to some vertex in S. We show that the minimum size of a determining set for an order n tournament (its determining number) is bounded by n/3, while the minimum size of a resolving set for an order n strong tournament (its metric dimension) is bounded by n/2. Both bounds are optimal.Peer ReviewedPostprint (published version
Symmetry breaking in tournaments
We provide upper bounds for the determining number and the metric dimension of tournaments. A set of vertices S is a determining set for a tournament T if every nontrivial automorphism of T moves at least one vertex of S, while S is a resolving set for T if every two distinct vertices in T have different distances to some vertex in S. We show that the minimum size of a determining set for an order n tournament (its determining number) is bounded by n/3, while the minimum size of a resolving set for an order n strong tournament (its metric dimension) is bounded by n/2. Both bounds are optimal.Postprint (published version
Distinguishing tournaments with small label classes
A d-distinguishing vertex (arc) labeling of a digraph is a vertex (arc) labeling using d labels that is not preserved by any nontrivial automorphism. Let Ï(T) (ÏâČ(T)) be the minimum size of a label class in a 2-distinguishing vertex (arc) labeling of a tournament T. Gluck's Theorem implies that Ï(T) †ân/2â for any tournament T of order n. We construct a family of tournaments â such that Ï(T) â„ ân/2â for any tournament of order n in â. Additionally, we prove that ÏâČ(T) †â7n/36â + 3 for any tournament T of order n and ÏâČ(T) â„ ân/6â when T â â and has order n. These results answer some open questions stated by Boutin.Peer ReviewedPostprint (published version
On the Distinguishing Number of Cyclic Tournaments: Towards the Albertson-Collins Conjecture
A distinguishing -labeling of a digraph is a mapping from
the set of verticesof to the set of labels such that no
nontrivial automorphism of preserves all the labels.The distinguishing
number of is then the smallest for which admits a
distinguishing -labeling.From a result of Gluck (David Gluck, Trivial
set-stabilizers in finite permutation groups,{\em Can. J. Math.} 35(1) (1983),
59--67),it follows that for every cyclic tournament~ of (odd) order
.Let for every such tournament.Albertson and
Collins conjectured in 1999that the canonical 2-labeling given
by if and only if is distinguishing.We prove that
whenever one of the subtournaments of induced by vertices or
is rigid, satisfies Albertson-Collins Conjecture.Using
this property, we prove that several classes of cyclic tournaments satisfy
Albertson-Collins Conjecture.Moreover, we also prove that every Paley
tournament satisfies Albertson-Collins Conjecture
Tournaments with Midterm Reviews
In many tournaments investments are made over time and conducting a review only once at the end, or also at points midway through, is a strategic decision of the tournament designer. If the latter is chosen, then a rule according to which the results of the different reviews are aggregated into a ranking must also be determined. This paper takes a first step in the direction of answering how such rules are optimally designed. A characterization of the optimal aggregation rule is provided for a two-agent two-stage tournament. In particular, we show that treating the two reviews symmetrically may result in an equilibrium effort level that is inferior to the one in which only a final review is conducted. However, treating the two reviews lexicographically by first looking at the final review, and then using the midterm review only as a tie-breaking rule, strictly dominates the option of conducting a final review only. The optimal mechanism falls somewhere in between these two extreme mechanisms. It is shown that the more effective the first-stage effort is in determining the final reviewâs outcome, the smaller is the weight that should be assigned to the midterm review in determining the agentsâ ranking
Non-monotoniticies and the all-pay auction tie-breaking rule
Discontinuous games, such as auctions, may require special tie-breaking rules to guarantee equilibrium existence. The best results available ensure equilibrium existence only in mixed strategy with endogenously defined tie-breaking rules and communication of private information. We show that an all-pay auction tie-breaking rule is sufficient for the existence of pure strategy equilibrium in a class of auctions. The rule is explicitly defined and does not require communication of private information. We also characterize when special tie-breaking rules are really needed
- âŠ