Yawns!
Complaints and petitions loading...

We await the numerous threads that will grace this forum nextweek starting. Some near reclusive DT members will get busy once more. Good to have a change in the almost draconian DT setting.

So theymos, how they hanging?


I've only every received 88 merits (the first 1000 are auto for being Legendary), so I'm a little unsure how I am on the 250 merit list, unless it's not 100 merits that a person needs to get from one person, but the person *sending* the merits has received 250 merits.

The count of people who have 250+ received merit and who have added you to their trust list is 2.

Nah sorry, you're not on my list

Everyone should add ~Lauda to their trust settings ,

That should exclude the slut, since her ratings are all biased on the following

1. She does not like you.
2. You beat her in an argument
3. Your Escrow Service is better than her escrow service
4. You point out she is a crook that steal others money.


 

Theymos is a coward
Vod is a child rapist
Lauda is a known extortionist and her mouth is Theymos personal cock holster
achow101 is a dumb anal dwelling censorship butt monkey.
Tman is a mere dumb ass kissing child.

And let me guess, all of the above apply to you?


Hmmm. Maybe there's something you're not telling here.

I don't know how many 250+ receivers there are, but if someone is on a mission to get onto DT I guess there will be some stalking/favor currying going on to meet this (and other) criteria.
They'll be the bouncers at the DT club.

~snip~

I thought that I had a good idea for limiting each individual truster when handling the last two criteria: set it up as a circulation problem as below, and then find the maximum flow. The "user tX"s through whom flow passes would be the DT1s selected.

~snip

(The orders of the users would be randomized on each run.)

There are efficient algorithms for maximizing the flow in problems similar to this, which is why thinking about it in this way occurred to me. However, it turns out that the "exactly 0 or exactly 10" requirement on the rightmost edges makes finding an exact solution too difficult.

I might try to write an algorithm for finding an approximate solution to this, but I probably won't get to it in the near future. Anyone else want to give it a try? You might also be able to structure it as a knapsack problem or something else, but I haven't gotten around to thinking about that yet.

cough cough ASS KISSER.

Your sweet-talk seems fake, shoo retard.