Jährlicher Zubau und Rückbau von #Balkonsolarleistung in Deutschland mit Stand vom 22.05.2026.
Unplausible Inbetriebnahmedaten von 1900 bis 2017 wurden durch das Registrierungsdatum der #Steckersolaranlage ersetzt.
👉 Zusatzlesestoff:
Heavy boiling below the calm surface, occasionally breaking through... Incredible production by Samuel van Dijk aka VC-118A, Mohlao, Multicast Dynamics...
VC-118A — Silver (2021)
https://soundcloud.com/mohlao/silver
Hyundai says it would make Boston Dynamics a wholly owned subsidiary by acquiring SoftBank's ~10% stake; Hyundai bought an 80% stake in Boston Dynamics in 2021 (Reuters)
https://www.reuters.com/world/hyundai-motor-gro…
cofe: Collaboration in Financial Economics (2021)
Network of authors and commenters of papers in finantial economics, obtained from the acknowledgement sections of over 5,000 published research papers.
This network has 13967 nodes and 102039 edges.
Tags: Social, Directed, Weighted, Online, Collaboration
https://networks.ske…
On Website Technicals (2021-10) - Tech updates: crazy inexplicable GSC page experience. - https://www.earth.org.uk/note-on-site-technicals-53.html
RE: https://journa.host/@nikolas/116484651961932236
Note sure why France24 is running the news article now — the news is several years old now, 95% deciphered as of 2021! — but worth celebrating nonetheless.
Here’s a cool interview:
https://thepostil.com/francois-desset-on-the-decipherment-of-linear-elamite-writing-2/
And this marvelous researcher has actually published the symbols on this truly delightful page that makes me believe in the WWW all over again:
https://hatamti-elam.uliege.be/browse
US SEC filing: Vanguard marks down Ola Consumer's valuation to ~$70.3M; Ola, which faces intense competition from Uber and Rapido, was valued at $7.3B in 2021 (Kunal Manchanada/Entrackr)
https://entrackr.com/news/vanguard-marks-down-olas-valuation-to-70-mn-…
cofe: Collaboration in Financial Economics (2021)
Network of authors and commenters of papers in finantial economics, obtained from the acknowledgement sections of over 5,000 published research papers.
This network has 13967 nodes and 102039 edges.
Tags: Social, Directed, Weighted, Online, Collaboration
https://networks.ske…
/2
Herbekijk "Pano": Overstroming onderschat | VRT NWS Nieuws
https://www.vrt.be/vrtnws/nl/2021/10/14/herbekijk-pano-overstroming-onderschat/
(Ohh ... Maar dam werkt de media niet)
Link ⤴️ werkt niet
Tracxn: global edtech funding fell from $16.7B in 2021 to $2.6B in 2025, while the number of startups launched dropped from 10,491 in 2021 to just 645 in 2025 (Ananya Bhattacharya/Rest of World)
https://restofworld.org/2026/edtech-funding-collapse-k12-startups…
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