Results 101 to 110 of about 1,211,714 (251)
A concept of weighted connectivity on connected graphs [PDF]
The introduction of a {0,1}-valued game associated to a connected graph allows us to assign to each node a value of weighted connectivity to the different solutions that for the cooperative games are obtained by means of the semivalues.
Amer Ramon, Rafael+1 more
core +1 more source
This article provides a comprehensive overview of electroless plating, covering its basic mechanisms, bath composition, operating parameters, and metal layer characterization. It also addresses recent advancements, current limitations, and potential improvements, as well as the technology's applications in various industries.
Na Kyoung Kim+4 more
wiley +1 more source
Quantal Response Equilibria in Binary Choice Games on Graphs [PDF]
Static and dynamic equilibria in noisy binary choice games on graphs are considered. Equations defining static quantal response equilibria (QRE) for binary choice games on graphs with arbitrary topology and noise distribution are written. It is shown that in the special cases of complete graph and arbitrary noise distribution, and circular and star ...
arxiv
Maker-Breaker total domination game
Maker-Breaker total domination game in graphs is introduced as a natural counterpart to the Maker-Breaker domination game recently studied by Duch\^ene, Gledel, Parreau, and Renault. Both games are instances of the combinatorial Maker-Breaker games.
Gledel, Valentin+3 more
core
This work explores the thermal kinetics of laser‐zone‐drawn electrospun nanofibers. Laser‐zone drawing is a technique that allows for localized heating of nanofiber segments, which results in better mechanical drawing. The high surface‐to‐volume ratio of nanofibers allows for ultrafast thermal kinetics at small diameters.
Matthew D. Flamini+5 more
wiley +1 more source
Strategic Decompositions of Normal Form Games: Zero-sum Games and Potential Games [PDF]
We study new classes of games, called zero-sum equivalent games and zero-sum equivalent potential games, and prove decomposition theorems involving these classes of games. We say that two games are "strategically equivalent" if, for every player, the payoff differences between two strategies (holding other players' strategies fixed) are identical.
arxiv
Trading locality for time: certifiable randomness from low-depth circuits [PDF]
The generation of certifiable randomness is the most fundamental information-theoretic task that meaningfully separates quantum devices from their classical counterparts. We propose a protocol for exponential certified randomness expansion using a single
Coudron, Matthew+2 more
core +1 more source
Complex Assemblies of Colloidal Microparticles with Compliant DNA Linkers and Magnetic Actuation
High‐surface‐energy polycarbonate templates are used to assemble polystyrene microspheres, improving yields more than 100‐fold. These higher yields facilitate the construction of active colloids and complex microstructures, including 10‐sphere microrotors and a 26‐sphere “CMU.” These active colloids are connected with compliant DNA linkages, enabling ...
Taryn Imamura+5 more
wiley +1 more source
The Combinatorial Game Theory of Well-Tempered Scoring Games [PDF]
We consider the class of "well-tempered" integer-valued scoring games, which have the property that the parity of the length of the game is independent of the line of play. We consider disjunctive sums of these games, and develop a theory for them analogous to the standard theory of disjunctive sums of normal-play partizan games.
arxiv
Impartial Games and Recursive Functions [PDF]
Interest in 2-player impartial games often concerns the famous theory of Sprague-Grundy. In this thesis we study other aspects, bridging some gaps between combinatorial number theory, computer science and combinatorial games.
Larsson, Urban
core