Tootfinder

City Lives II 🔃
城市人生 II 🔃
📷 Pentax 6x7
🎞️ LUCKY SHD 400 (6x7)
If you like my work, Support by buying me a coffee or a roll of film from
PayPal https://www.paypal.com/paypalme/ydcdingsite
Wise

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

I Ran 8 #Local AIs on My base #MacMini M4 — Here Are the 7 That Actually Fly (Real Numbers)
…

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

After Colleges Reject ‘Compact,’ Trump Officials Try a Letter
The open letter from Education Secretary Linda McMahon fell short of the attempt at a compact last year
that dangled research money in return for embracing the Trump administration’s agenda.
Ms. McMahon’s letter,
which does not include any funding threats,
suggests that changes will improve academia’s reputation among American parents and students.
“The dilution of academic standards,
opaq…

After Colleges Reject ‘Compact,’ Trump Officials Try a Letter
The open letter from Education Secretary Linda McMahon fell far short of the attempt at a compact last year that dangled research money in return for embracing the Trump administration’s agenda.

#CommonplaceBook reading, abundance, maybe some hopeful green shoots. Read to the end for a picture of me weeding out the less good green shoots.
https://lbj20.blogspot.com/2026/08/com

Commonplace book: reading, abundance, green shoots
Mandy Brown argues that the attention economy is misnamed (HT Sentiers). Reading is the art of attention. What a mess we’ve made of that...

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:

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