scholarly journals Random-Player Maker-Breaker games

10.37236/5032 ◽  
2015 ◽  
Vol 22 (4) ◽  
Author(s):  
Michael Krivelevich ◽  
Gal Kronenberg
Keyword(s):  
Perfect Matching ◽  
Winning Strategy ◽  
Hamilton Cycle ◽  
The Other ◽  
Natural Question ◽  
Vertex Connectivity ◽  
Asymptotic Values ◽  
Player Game ◽  
Matching Game ◽  
As If

In a $(1:b)$ Maker-Breaker game, one of the central questions is to find the maximal value of $b$ that allows Maker to win the game (that is, the critical bias $b^*$). Erdős conjectured that the critical bias for many Maker-Breaker games played on the edge set of $K_n$ is the same as if both players claim edges randomly. Indeed, in many Maker-Breaker games, "Erdős Paradigm" turned out to be true. Therefore, the next natural question to ask is the (typical) value of the critical bias for Maker-Breaker games where only one player claims edges randomly. A random-player Maker-Breaker game is a two-player game, played the same as an ordinary (biased) Maker-Breaker game, except that one player plays according to his best strategy and claims one element in each round, while the other plays randomly and claims $b$ (or $m$) elements. In fact, for every (ordinary) Maker-Breaker game, there are two different random-player versions; the $(1:b)$ random-Breaker game and the $(m:1)$ random-Maker game. We analyze the random-player version of several classical Maker-Breaker games such as the Hamilton cycle game, the perfect-matching game and the $k$-vertex-connectivity game (played on the edge set of $K_n$). For each of these games we find or estimate the asymptotic values of the bias (either $b$ or $m$) that allow each player to typically win the game. In fact, we provide the "smart" player with an explicit winning strategy for the corresponding value of the bias.

scholarly journals Strong Games Played on Random Graphs

10.37236/5414 ◽  
2017 ◽  
Vol 24 (1) ◽  
Author(s):  
Asaf Ferber ◽  
Pascal Pfister
Keyword(s):  
Random Graph ◽  
Random Graphs ◽  
Perfect Matching ◽  
Hamilton Cycle ◽  
Target Structure ◽  
Fixed Constant ◽  
Matching Game

In a strong game played on the edge set of a graph $G$ there are two players, Red and Blue, alternating turns in claiming previously unclaimed edges of $G$ (with Red playing first). The winner is the first one to claim all the edges of some target structure (such as a clique $K_k$, a perfect matching, a Hamilton cycle, etc.). In this paper we consider strong games played on the edge set of a random graph $G\sim G(n,p)$ on $n$ vertices. We prove that $G\sim G(n,p)$ is typically such that Red can win the perfect matching game played on $E(G)$, provided that $p\in(0,1)$ is a fixed constant. 

scholarly journals Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs

2010 ◽  
Vol 20 (2) ◽  
pp. 173-211 ◽  
Author(s):  
SONNY BEN-SHIMON ◽  
MICHAEL KRIVELEVICH ◽  
BENNY SUDAKOV
Keyword(s):  
Random Graph ◽  
Regular Graph ◽  
High Probability ◽  
Perfect Matching ◽  
Winning Strategy ◽  
Graph Model ◽  
Vertex Connectivity ◽  
Random Graph Model ◽  
Graph Properties ◽  
Local Resilience

For an increasing monotone graph propertythelocal resilienceof a graphGwith respect tois the minimalrfor which there exists a subgraphH⊆Gwith all degrees at mostr, such that the removal of the edges ofHfromGcreates a graph that does not possess. This notion, which was implicitly studied for somead hocproperties, was recently treated in a more systematic way in a paper by Sudakov and Vu. Most research conducted with respect to this distance notion focused on the binomial random graph model(n, p) and some families of pseudo-random graphs with respect to several graph properties, such as containing a perfect matching and being Hamiltonian, to name a few. In this paper we continue to explore the local resilience notion, but turn our attention to random and pseudo-randomregulargraphs of constant degree. We investigate the local resilience of the typical randomd-regular graph with respect to edge and vertex connectivity, containing a perfect matching, and being Hamiltonian. In particular, we prove that for every positive ϵ and large enough values ofd, with high probability, the local resilience of the randomd-regular graph,n, d, with respect to being Hamiltonian, is at least (1−ϵ)d/6. We also prove that for the binomial random graph model(n, p), for every positive ϵ > 0 and large enough values ofK, ifp>$\frac{K\ln n}{n}$then, with high probability, the local resilience of(n, p) with respect to being Hamiltonian is at least (1−ϵ)np/6. Finally, we apply similar techniques to positional games, and prove that ifdis large enough then, with high probability, a typical randomd-regular graphGis such that, in the unbiased Maker–Breaker game played on the edges ofG, Maker has a winning strategy to create a Hamilton cycle.

From Container to Claustrum: Projective Identification in Couples

2014 ◽  
Vol 4 (2) ◽  
Author(s):  
Tamara Feldman
Keyword(s):  
Psychological Health ◽  
Projective Identification ◽  
The Self ◽  
The Other ◽  
Intimate Partners ◽  
And Control ◽  
The Relationship ◽  
As If

This paper is a contribution to the growing literature on the role of projective identification in understanding couples' dynamics. Projective identification as a defence is well suited to couples, as intimate partners provide an ideal location to deposit unwanted parts of the self. This paper illustrates how projective identification functions differently depending on the psychological health of the couple. It elucidates how healthier couples use projective identification more as a form of communication, whereas disturbed couples are inclined to employ it to invade and control the other, as captured by Meltzer's concept of "intrusive identification". These different uses of projective identification affect couples' capacities to provide what Bion called "containment". In disturbed couples, partners serve as what Meltzer termed "claustrums" whereby projections are not contained, but imprisoned or entombed in the other. Applying the concept of claustrum helps illuminate common feelings these couples express, such as feeling suffocated, stifled, trapped, held hostage, or feeling as if the relationship is killing them. Finally, this paper presents treatment challenges in working with more disturbed couples.

Rhetoric and argumentation: the unity of the field

2017 ◽  
Author(s):  
Michel Meyer
Keyword(s):  
The Other ◽  
Classic Problem ◽  
False Dilemma ◽  
The Difference ◽  
As If

Rhetoric has always been torn between the rhetoric of figures and the rhetoric of conflicts or arguments, as if rhetoric were exclusively one or the other. This is a false dilemma. Both types of rhetoric hinge on the same structure. A common formula is provided in Chapter 3 which unifies rhetoric stricto sensu and rhetoric as argumentation as two distinct but related strategies adopted according to the level of problematicity of the questions at stake, thereby giving unity to the field called “Rhetoric.” Highly problematic questions require arguments to justify their answers; non-divisive ones can be treated rhetorically through their answers as if they were self-evident. Another classic problem is how to understand the difference between logic and rhetoric. The difference between the two is due to the presence of questions explicitly answered in the premises in logic and only suggested (or remaining indeterminate) in rhetoric.

Ergative, antipassive and other verb derivational morphemes in Gaahmg

2014 ◽  
Vol 35 (2) ◽  
Author(s):  
Timothy M. Stirtz
Keyword(s):  
The Other ◽  
Case Marking ◽  
Derivational Morphemes ◽  
As If

AbstractGaahmg has ergative traces in a predominately nominative-accusative system. Clauses with object focus demonstrate ergative case marking on postverbal noun and pronoun agents, and an ergative morpheme is also bound to verbs. Other evidence for ergativity is that the ergative morpheme is morphologically and syntactically distinct from the passive morpheme. Ergative morphemes and constructions in Gaahmg are similar to those of other Nilo-Saharan languages, including Luwo, Päri, and Shilluk. The Gaahmg antipassive also resembles that of other Nilo-Saharan languages. Yet, unlike other languages with ergativity and antipassives, Gaahmg readily combines the antipassive with ergative, passive, and causative morphemes in the same verb form. The Gaahmg antipassive occurs in nominative-accusative structures, as well as in object-focus clauses with ergative-absolutive structures. Further, the antipassive co-occurs with the passive, as if both the nominative-accusative and ergative-absolutive structures are simultaneously present in the same clause, and the language is currently shifting from one structure to the other.

Expressions for the perfect matching numbers of cubicl x m x n lattices and their asymptotic values

1996 ◽  
Vol 20 (1) ◽  
pp. 67-77 ◽  
Author(s):  
Hideyuki Narumi ◽  
Hideaki Kita ◽  
Haruo Hosoya
Keyword(s):  
Perfect Matching ◽  
Asymptotic Values

When Do Politicians Lie?

2012 ◽  
Vol 12 (3) ◽  
Author(s):  
Paul Armstrong-Taylor
Keyword(s):  
The Other ◽  
Simple Observation ◽  
Other Hand ◽  
As If

Abstract When do politicians lie? A politician who admits to wrongdoing will likely suffer some loss of popularity, but probably not as great as if he denied wrong doing and was subsequently discovered to have lied. This simple observation has a number of implications. For example, a politician in a marginal seat may have little choice but to risk lying as admitting will lose him too much popularity to survive. On the other hand, a politician in a relatively safe seat might survive the loss from admitting, but not from lying and being caught. Therefore we might predict the likelihood that a politician admits to a scandal to be positively related (over some range at least) to the security of his seat. This paper tests this prediction, and some others, with data from House bank scandal of 1991-92.

Interpersonal Attraction in a Role-Played Interaction

1973 ◽  
Vol 32 (2) ◽  
pp. 627-634 ◽  
Author(s):  
Michael J. Gatton ◽  
Don A. Nelson
Keyword(s):  
Interpersonal Attraction ◽  
Eye Contact ◽  
Role Playing ◽  
The Other ◽  
Behavioral Correlates ◽  
Response Latencies ◽  
Similarity Attraction ◽  
Paper And Pencil ◽  
High Attraction ◽  
As If

To look at the usefulness of a neutral task in studying 2-person interactions, to ascertain some behavioral correlates of experimentally manipulated attraction, to investigate the generality of the similarity-attraction hypothesis, and to examine the behavioral relevance of scores on a commonly used paper-and-pencil attraction scale, Ss interacted with confederates posing as Ss. Each S was given the impression that C had similar or dissimilar attitudes and twice S performed an incomplete sentences task administered by C. On one set of trials, S was instructed to act as if he liked C, and on the other set as if he did not. Measured behaviors were eye contact, interview length, number of words used, smiles, and both S's and C's response latencies. In the high-attraction role-playing condition, more smiles and a higher percentage of eye contact occurred than in the low-attraction role-playing condition. But no differences in the other behaviors were noted, only very mild support was obtained for the similarity-attraction hypothesis, and none of the measures were related to scores on the paper-and-pencil index of interpersonal attraction.

scholarly journals Sharp Threshold Functions for Random Intersection Graphs via a Coupling Method

10.37236/523 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Katarzyna Rybarczyk
Keyword(s):  
Perfect Matching ◽  
Hamilton Cycle ◽  
Coupling Method ◽  
New Method ◽  
Intersection Graphs ◽  
Sharp Threshold ◽  
Threshold Functions

We present a new method which enables us to find threshold functions for many properties in random intersection graphs. This method is used to establish sharp threshold functions in random intersection graphs for $k$–connectivity, perfect matching containment and Hamilton cycle containment.

Derrida’s Quasi-Technique

2016 ◽  
Vol 46 (3) ◽  
pp. 369-389
Author(s):  
Susanna Lindberg
Keyword(s):  
Philosophy Of Technology ◽  
The Other ◽  
List Type ◽  
Contemporary Philosophy ◽  
As If

The article’s aim is to measure the potential of Derrida’s work for a philosophy of technique. It shows why Derrida does not present a positive philosophy of technology but rather describes technique as a quasi-technique, as if a technique. The article inquires into the potential of such a quasi-technique for a contemporary philosophy of technology: it is suggested that it can function as a salutary “deconstruction” of mainstream philosophy of technology (that “knows” the “essence of technology”) because it shows how to think technique in the absence of essence and as the absence of essence. The article begins with a survey of the machines that figure in Derrida’s texts. It then examines three propositions concerning technology in Derrida’s work: Derrida thinks technology as a metaphor of writing and not the other way round. Derrida thinks technique as prosthesis, firstly of memory, then more generally of life. Derrida’s quasi-technique relies on his peculiar conception of the incorporal materiality of technique.

Sign in / Sign up

Export Citation Format

Share Document