Tootfinder

GSM: Der Anfang vom Ende in Österreich
Der Countdown für GSM hat nun auch in Österreich begonnen. Die Abschaltung trifft vor allem Maschinen, kann aber auch die Netzabdeckung reduzieren.
https://www.hei…

GSM: Der Anfang vom Ende in Österreich
Der Countdown für GSM hat nun auch in Österreich begonnen. Die Abschaltung trifft vor allem Maschinen, kann aber auch die Netzabdeckung reduzieren.

Is #Ubuntu going pro #genAI??
(worried by this post from @…) :

🇺🇦 #NowPlaying on KEXP's #VarietyMix
Yalla Miku:
🎵 Maximum Self-Care
#YallaMiku
https://yallamiku.bandcamp.com/track/maximum-self-care
https://open.spotify.com/track/1faaEMR5x5dZuB8x9Rs8br

Aylo says it will restore Pornhub access in the UK, but only for users who have verified their age via iOS 26.4's device-level age verification system (Liv McMahon/BBC)
https://www.bbc.com/news/articles/cwy27q05gj2o

Pornhub to become accessible again for some UK users
UK iPhone users who have completed Apple's device-based age checks will no longer be blocked from the site's adult content.

The $9 billion liability across the street from the Capitol (Katherine Tully-McManus/Politico)
https://www.politico.com/news/2026/06/04/rayburn-house-office-building-renovation-00949497
http://www.memeorandum.com/260604/p6#a260604p6

Improved Approximation Guarantees for Groupwise Maximin Share Fairness
Georgios Amanatidis, Anna Korfiati, Evangelos Markakis, Christodoulos Santorinaios
https://arxiv.org/abs/2606.04731 https://arxiv.org/pdf/2606.04731 https://arxiv.org/html/2606.04731
arXiv:2606.04731v1 Announce Type: new
Abstract: We study the problem of fairly allocating a set of indivisible goods to a set of $n$ agents with additive valuation functions. We focus on the very demanding notion of \textit{groupwise maximin share fairness} (GMMS), which requires that each agent $i$ receives value comparable to their maximin share, where the latter is computed \textit{with respect to any subset of agents that contains $i$}. We show that it is possible to compute $(\phi-1)$-approximate GMMS allocations in polynomial time, where $\phi \approx 1.618$ is the golden ratio). This improves on the previously known guarantee of $4/7$ of Chaudhury et al. [SICOMP; 2021] and Amanatidis et al. [TCS; 2020]. We propose a simple algorithm that maintains the same main properties as the Draft-and-Eliminate algorithm of Amanatidis et al. [TCS, 2020] and we improve on the approximation guarantee analysis by carefully bounding the relevant value within any subinstance induced by the restriction of our allocation to a subset of agents. Our analysis is asymptotically tight for algorithms that share these properties and has the additional benefit of giving improved guarantees for restricted settings; in particular, when the agents agree on the top $n$ goods or when the number of agents is small. To illustrate the challenges of going beyond the guarantees of our algorithm, we also present a variant with an improved approximation of $(\sqrt{10}-1)/3 \approx 0.72$ for the case of three agents. To achieve this improvement we partially characterize the maximin share guarantees of short picking sequences for a small number of goods.
toXiv_bot_toot

Strukturierte Daten auf #wikicommons sind ungemein nützlich. Mit ihnen lassen sich z.B. Bildinhalte strukturiert und (dank Linked Open Data) wunderbar maschinenlesbar erfassen und dann auch mit #SPARQL abfragen. Bilder von SPD-Mitgliedern des Weimarer Reichtstags? Kein Problem:

US-Militär will MQ-9A-Reaper-Drohne zu Drohnenmutterschiff ausbauen
Die Langstreckendrohne MQ-9A Reaper soll zu einem Drohnenmutterschiff umfunktioniert werden. Sie setzt Drohnen ab und koordiniert deren jeweiligen Missionen.
…

US-Militär will MQ-9A-Reaper-Drohne zu Drohnenmutterschiff ausbauen
Die Langstreckendrohne MQ-9A Reaper soll zu einem Drohnenmutterschiff umfunktioniert werden. Sie setzt Drohnen ab und koordiniert deren jeweiligen Missionen.

🇺🇦 #NowPlaying on KEXP's #AfternoonShow
Mei Semones:
🎵 I can do what I want
#MeiSemones
https://open.spotify.com/track/3pAggfK0BtAzU6fDyW6DUy

Simultaneous EF1 and approximate MMS allocations for submodular valuations
Uriel Feige, Assaf Fine
https://arxiv.org/abs/2606.06451 https://arxiv.org/pdf/2606.06451 https://arxiv.org/html/2606.06451
arXiv:2606.06451v1 Announce Type: new
Abstract: There are two common classes of fairness notions that are considered when allocating $m$ indivisible items to $n$ agents of equal entitlements. One is that of share-based fairness notions, with the maximin share (MMS) and its relaxations to $\rho$-MMS being prominent representatives of this class. The other is that of comparison-based fairness notions, with envy-freeness (EF) and its relaxations such as EF1 being prominent representatives of this class. In general, no class offers good guarantees for the other class. In this work, we design allocations that simultaneously satisfy notions from both classes, and specifically, are $\rho$-MMS for constant $\rho$ and EF1 (in fact, also EFL). Such results were previously known when agents have additive valuations, and we prove such results for the more general class of submodular valuations.
toXiv_bot_toot