Jährlicher Zubau und Rückbau von #Balkonsolarleistung in Deutschland mit Stand vom 29.06.2026.
Unplausible Inbetriebnahmedaten von 1900 bis 2017 wurden durch das Registrierungsdatum der #Steckersolaranlage ersetzt.
👉 Zusatzlesestoff:
Ladies & gentlemen of #GenX, take a moment to listen to Russell & Hitchcock harmonize at 72yo back in 2021.
▶️ Air Supply - All Out of Love (Tour Concert - The Florida Theatre, Jacksonville)
https://
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
Anzahl der Inbetriebnahmen von Balkonkraftwerken pro Jahr in #Deutschland mit Stand vom 29.06.2026.
Unplausible Inbetriebnahmedaten von 1900 bis 2017 wurden durch das Registrierungsdatum der #Steckersolaranlage ersetzt.
👉 Zusatzlesestoff:
The US OMB recently published a new logging reference architecture M-26-14 replacing 2021's M-21-31.
I'm not familiar enough with CISA and the bureaucracy to confidently provide a useful analysis, but the two different memorandums are noticeably different that I'm sure someone with more familiarity could say something interesting about the potential consequences, positive or negative.
celebrate bobsday 85 with 18 hours of dylanological pleasures! live tapes! covers! novelties! WTFs! the past 6 frow show @… blowouts:
2021: https://wfmu.org/playlists/shows/104186
Anzahl der registrierten #Balkonkraftwerke in #Deutschland mit Stand vom 29.06.2026.
Der aktuelle Höchststand liegt bei 1401132 registrierten Anlagen.
Unplausible Inbetriebnahmedaten von 1900 bis 2017 wurden durch das Registrierungsdatum der
Kumulativer Zubau von #Balkonsolarleistung in #Deutschland mit Stand vom 29.06.2026.
Die summierte Leistung aller offiziell registrierten #Steckersolaranlagen beträgt b…