Bipartite containment control of multi-agent systems subject to adversarial inputs based on zero-sum game
References
Index Terms
- Bipartite containment control of multi-agent systems subject to adversarial inputs based on zero-sum game
Recommendations
A note on dynamic zero-sum games
CCDC'09: Proceedings of the 21st annual international conference on Chinese control and decision conferenceDynamic games play prominently roles in the management field and in the economic community. In this note, a dynamic zero-sum game with two players is considered. By comparing one player under feedback information structure with the other player under ...
The neighbour-sum-distinguishing edge-colouring game
Let :E(G)N=N{0} be an edge colouring of a graph G and :V(G)N the vertex colouring given by (v)=ev(e) for every vV(G). A neighbour-sum-distinguishing edge-colouring of G is an edge colouring such that for every edge uv in G, (u)(v). The neighbour-sum-...
Game total domination for cyclic bipartite graphs
AbstractLet G = ( V , E ) be a graph. A vertex u in G totally dominates a vertex v if u is adjacent to v in G. The total domination game played on G consists of two players, named Dominator and Staller, who alternately take turns choosing vertices of G ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Elsevier Science Inc.
United States
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in