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?
Gaiagov2023
Answer
- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.
Kav10
-
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.
-
Thanks Kav, I'm waiting for response from team to use python. If they need help how much time are you thinking?
-
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.
-
-
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]?
-
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?
-
-
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
-
@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?
-
Sounds good Gaiagov2023!
-
- answered
- 465 views
- $30.00
Related Questions
- Pathwise connected
- Let $f\in C (\mathbb{R})$ and $f_n=\frac{1}{n}\sum\limits_{k=0}^{n-1} f(x+\frac{k}{n})$. Prove that $f_n$ converges uniformly on every finite interval.
- separability and completeness
- Prove that $A - B=A\cap B^c$
- Let $(X, ||\cdot||)$ be a normed space. Let $\{x_n\}$ and $\{y_n\}$ be two Cauchy sequences in X. Show that the seqience Show that the sequence $λ_n = ||x_n − y_n|| $ converges.
- Probability/Analysis Question
- [Real Analysis] Show that $B$ is countable.
- real analysis
Could you try to rephrase your question?
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.
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.