PLEASE NOTE: this server,, will be unavailable on Monday 5th December, from 1pm until 4pm.
Web-based programs, such as csmarks, cssubmit, and the help fora, will all be unavailable.
  It's UWAweek 49


This forum is provided to promote discussion amongst students enrolled in CITS3001 Algorithms, Agents and Artificial Intelligence.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.

How do I ask a good question?
Displaying selected article
Showing 1 of 175 articles.
Currently 5 other people reading this forum.

 UWA week 31 (2nd semester, week 2) ↓
SVG not supported

Login to reply
3:10pm Sun 7th Aug, Sae-Hwa Y.


Could I clarify the following aspects of the project? Sorry for asking many questions.


  1. The graph modelling the Green Team should be based on social network graphs of real-world populations? In other words, we have to justify why the chosen number of nodes and weights of the vertices create a plausible population model. For example, having a minimum number of nodes for a meaningful network to be formed, having connectivity patterns similar to those present in real-world networks, etc.
    • Graph is undirected since members can mutually affect each other when they interact .
    • Graph is not necessarily fully connected in the sense that weights of edges between members can be 0. But is a weight of 1 possible (guaranteed interaction)?
  2. As for the initial opinions and certainty of the Green Team members,
    • are they affected by the particular node's surroundings in the graph?
    • is the certainty distribution uniform, normal, or ... ?
    • are the certainty values discrete or continuous?
    • are the certainty values bounded or unbounded?
    • can these two parameters can be represented by just one number? For instance, if we use a scale from -1 to 1, positive values would be one opinion while negative values are the other opinion.

During each round

Green Team's turn

  1. Each round, we conduct a random experiment for EVERY pair of Green Team member (using the edge weights as the probability of an interaction occurring) and there are no restrictions on number of interactions a member can have? Is there a particular order of interaction: fixed, random, simultaneous?
  2. When there is an interaction between Green Team members with differing certainty but the same opinion, what is the effect? (1) certainty of both increase, (2) only certainty of less certain member increases, (3) nothing happens
  3. When there is an interaction between Green Team members with differing certainty and opinion, the opinion of the more uncertain member changes. How much is the change and is it affected by the difference between the certainties of the two members?

Red Team's turn

  1. Choose one of five levels of certainty to interact with ALL Green Team members it is still connected to (starts off connected to every Green Team member). Red Team member is either connected or NOT connected to a particular Green Team member)?
  2. If the difference between the level of certainty is beyond a certain threshold, the Red Team member is NO longer able to interact with that Green Team member for the rest of the game?
  3. However, those members that share Red's opinion are affected in the same manner as point 2 under Green Team's turn (interacting with a Green Team member with the same opinion but higher certainty)?
  4. As for those members that do not share Red's opinion but are within the aforementioned threshold, nothing happens to them?

Blue Team's turn

  1. Has two possible moves: interact with the Green Team members or let a Grey agent into the network. Is it the case that only one of these can be done each turn?
  2. Is there a limit to the number of Grey agents that can be added?
  3. Not possible to lose ability to interact with Green Team members unlike Red Team?
  4. Nothing happens when interacting with a Green Team member with a different opinion?
  5. When interacting with a member sharing the same opinion, (1) nothing happens if the Green Team member's certainty is higher while (2) interacting with a Green Team member of lower certainty has the same effect as point 2 under Green Team's turn?
  6. Is it possible to target only certain Green Team members to conserve energy?
    • Likewise for Red (target a subset of the Green Team members that it can still interact with)

Grey Team's turn

  1. Does a Grey agent remain till the end of the game or leaves after a certain number of rounds after being added?
  2. What opinion/certainty distribution do we use for the Grey agent?
  3. How is the Grey agent inserted into the network? In other words, what are the weights of the edges between the Grey agent and the Green Team members. Is it 1 (guaranteed interaction) for every edge similar to the Red and Blue team or ...?
  4. Are interactions between Grey agents and Green Team members the same as between Green Team members except for the difference that it is not possible for the Grey agent's opinion and certainty to be affected?


  1. When does game end?
    • After a predetermined number of rounds?
    • Unless Blue Team runs out of energy or Red Team loses connection to all the Green agents?
  2. Win is decided solely by opinion (ignoring certainty)? For example, if one opinion has one more member compared to the other opinion, the former opinion wins even if the members with the latter opinion have a higher certainty?

Aside from the above, could I also check if the following are typos:

  1. The two highlighted parts seem to present contradictory info about the Green government. Should the mention of the "Green government" at the start of the second highlight be "Red government" instead?

  1. Should the highlighted part be rephrased to "if they make a big claim or lie too much"?

This article has 2 attachments:



The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  1:17AM Sep 14 2022
Privacy policy