Tootfinder

https://www.derstandard.at/story/3000000298932/ex-wohnungsloser-eine-kuchl-und-eine-couch-mehr-brauche-ich-nicht

Ex-Wohnungsloser: "Eine Kuchl und eine Couch, mehr brauche ich nicht"
Helmut F. lebt im zehnten Wiener Bezirk. In seine aktuelle Wohnung kam der ehemals wohnungslose Mann über Neunerhaus und das Housing-First-Modell

Winning The Room With Jonathan Pease
We speak with industry leaders, provocative thinkers, subject matter experts to get their perspective on human connection...
Great Australian Pods Podcast Directory: https://www.greataustralianpods.com/winning-the-room/
…

@… #Winning

Vikes' McCarthy 'plays winning football' in return https://www.espn.com/nfl/story/_/id/47240336/vikings-jj-mccarthy-plays-winning-football-return

Strategyproof Tournament Rules for Teams with a Constant Degree of Selfishness
David Pennock, Daniel Schoepflin, Kangning Wang
https://arxiv.org/abs/2512.05235 https://arxiv.org/pdf/2512.05235 https://arxiv.org/html/2512.05235
arXiv:2512.05235v1 Announce Type: new
Abstract: We revisit the well-studied problem of designing fair and manipulation-resistant tournament rules. In this problem, we seek a mechanism that (probabilistically) identifies the winner of a tournament after observing round-robin play among $n$ teams in a league. Such a mechanism should satisfy the natural properties of monotonicity and Condorcet consistency. Moreover, from the league's perspective, the winner-determination tournament rule should be strategyproof, meaning that no team can do better by losing a game on purpose.
Past work considered settings in which each team is fully selfish, caring only about its own probability of winning, and settings in which each team is fully selfless, caring only about the total winning probability of itself and the team to which it deliberately loses. More recently, researchers considered a mixture of these two settings with a parameter $\lambda$. Intermediate selfishness $\lambda$ means that a team will not lose on purpose unless its pair gains at least $\lambda s$ winning probability, where $s$ is the individual team's sacrifice from its own winning probability. All of the dozens of previously known tournament rules require $\lambda = \Omega(n)$ to be strategyproof, and it has been an open problem to find such a rule with the smallest $\lambda$.
In this work, we make significant progress by designing a tournament rule that is strategyproof with $\lambda = 11$. Along the way, we propose a new notion of multiplicative pairwise non-manipulability that ensures that two teams cannot manipulate the outcome of a game to increase the sum of their winning probabilities by more than a multiplicative factor $\delta$ and provide a rule which is multiplicatively pairwise non-manipulable for $\delta = 3.5$.
toXiv_bot_toot

Abortion will stay legal in Wyoming
after the state’s supreme court struck down two near-total abortion bans on Tuesday,
ruling that the laws violate the constitution of the profoundly conservative state.
In a 4-1 decision, the justices decided that the two bans
– which include the nation’s first exclusive ban on abortion pills
– violated a 2012 state constitutional amendment.
That amendment affirmed competent adults’ right to make their own healthcare de…

Einige der zuletzt hier besonders häufig geteilten #News:
Berlin: Polizei darf Wohnungen zur Staatstrojaner-Installation heimlich betreten

Broncos beat Raiders 24-17 to extend winning streak to 10 games as Geno Smith injured https://www.foxsports.com/articles/nfl/broncos-beat-raiders-2417-to-extend-winning-streak-to-10-games-as-geno-smith-injured

Ranking Super Bowl underdogs by their chances of winning it all https://www.nytimes.com/athletic/6951295/2026/01/08/super-bowl-betting-underdogs-chargers-bears-packers-49ers/

The Trump administration is telling states NOT to pay full November food stamp benefits,
revising its previous guidance after winning a temporary victory at the Supreme Court on Friday
https://www.politico.com/news/2025/11/09/t