$Math and graph representing a competitive struggle between competitors with a fixed number of supporters.$

Question

$Math and graph representing a competitive struggle between competitors with a fixed number of supporters.$

A data set of 1000. 10 competitors. Need a graph over time representing gain or loss for each competitor starting with 0 which represents 1000/10. Positive when competitor wins support from other competitor and negative from looser. Is there an algorithm that can be used to calculate and graph data?

Real Analysis

Gaiagov2023

10

Report

Mathe

+1

Could you try to rephrase your question?
Gaiagov2023

0

Hi Kev, I'm trying to develop an app that brings people closer to their governments. The idea is to allow people to virtually move their support between law makers in the same legislative body. By taking the sum of support for all law makers voting yes, to a piece of legislation, devided by the total support available times 100 or percentage of concensus. I think you have grasped the question well. I was hoping ther was a ready made algorithm where you could pop in the fixed values.
Gaiagov2023

0

I will suggest programmers use python. I would like to use a graph for each legislator where support is reset to 0 after election and then shows popularity of positive or negative with 0 as x axis over time.

Answer

The answer is accepted.

Join Matchmaticians Affiliate Marketing Program to earn up to a 50% commission on every question that your affiliated users ask or answer.

Gaiagov2023

0

Hi Kev, I'm trying to develop an app that brings people closer to their governments. The idea is to allow people to virtually move their support between law makers in the same legislative body. By taking the sum of support for all law makers voting yes, to a piece of legislation, devided by the total support available times 100 or percentage of concensus. I think you have grasped the question well. I was hoping ther was a ready made algorithm where you could pop in the fixed values.
Gaiagov2023

0

I will suggest programmers use python. I would like to use a graph for each legislator where support is reset to 0 after election and then shows popularity of positive or negative with 0 as x axis over time.

Answer 1

Answers can only be viewed under the following conditions:

The questioner was satisfied with and accepted the answer, or
The answer was evaluated as being 100% correct by the judge.

View the answer

Hey Gaiagov2023,

Yes, you can simulate it using an algorithm. The simulation will simulate the competitive struggle and track the gains or losses for each competitor over time. I think there are some typos in your question, but here is a basic outline of how you could approach this:

As you mentioned, start with each competitor having an equal number of supporters, which is 1000/10 = 100 supporters each.

Simulate interactions between the competitors over multiple time steps. In each time step, randomly select pairs of competitors and determine if one gains supporters from the other. You could use various methods for this, such as a random chance of one competitor gaining supporters from another, or more complex models based on factors like the popularity of each competitor or their strategies.

After each interaction, update the supporter counts for each competitor based on the outcomes of the interactions.

Repeat the simulation for a certain number of time steps.

After the simulation is complete, you can plot a graph showing the changes in supporter counts for each competitor over time.

Alternatively, you can use a network analysis algorithm and approach this using network graphs to better visualize it. This approach gives you a dynamic representation of how the support between competitors evolves over time.

Construct a network graph by representing competitors as nodes and their interactions (gain or loss) as edges between them.

Set/assign the initial value for each competitor as 1000/10 (since each competitor starts with an equal share as you noted in your question).

Based on the dataset, update the values of each competitor according to the gains or losses observed (or simulated as I explained above). You can use various algorithms here like weighted averaging based on the interactions. For example, if competitor A gains support from competitor B, subtract the gained support from B's total and add it to A's total.

Plot the values over time to visualize the changes. You can use a line graph where the x-axis represents time and the y-axis represents the value (gain or loss) for each competitor.

For doing the above, a Python code can be written to simulate the steps and interactions.

For a more advanced representation of the competitions and interactions, please see this:

https://www.hindawi.com/journals/mpe/2020/2517415/

Kav10

1.9K

Kav10

0

I am glad that I have grasped the question well! I can try to write a python code for the steps I provided above but it takes some time.
Gaiagov2023

0

Thanks Kav, I'm waiting for response from team to use python. If they need help how much time are you thinking?
- Kav10
  
  0
  
  Sure. Do you like the approach I provided above? Do you want me write a Python code for that? If the approach makes sense to you, I can write a python code on Monday.
Gaiagov2023

0

Thanks Kav, I do like your approach. We want to be able to demonstrate the popularity of each legislator inside a legislative body with a graph over time of + or - support on the x axis. The x axis is set to 0 after an election. At that time each legislator has support from total #of voters / number of legislators. Are you AI? Would you like to communicate using my email [email protected]?
- Kav10
  
  0
  
  Sounds good. But Matchmaticians does not allow communication outside their platform. Unless that has changed recently, we need to communicate here. I can work on the code tomorrow and send it here. I will let you know how much time I spent. I charge $65/hr. The website takes 20% commission. You can then tip me here. Does that work for you?
Gaiagov2023

0

Hi Kav10, Just asking, like everything on internet these days, all locked down. I haven't heard from my developers yet. We usually meet Tuesday night. If they can use code I will hire you. Thanks again
- Kav10
  
  0
  
  @Matchmaticians, please let me know if things have changed and users are allowed to interact outside the platform and maybe come back here to set a question or add tip?
- Kav10
  
  0
  
  Sounds good Gaiagov2023!

$Math and graph representing a competitive struggle between competitors with a fixed number of supporters.$

Answer

Related Questions

Search