@Sustainable2050@mastodon.energy"Ever more people are annoyed by the climate being so pushy these days, with all its heatwaves, wildfires, and floods. KLM agrees: Freedom of expression is valuable, but if we can't do our work because people get hesitant to book flights to Italy, we have to ask whether we can still tolerate this." /s
@EarthOrgUK@mastodon.energyOn Website Technicals (2021-10) - Tech updates: crazy inexplicable GSC page experience. - https://www.earth.org.uk/note-on-site-technicals-53.html
@fanf@mendeddrum.orgfrom my link log —
Don't make my mistakes: common infrastructure errors i've made.
https://matduggan.com/mistakes/
saved 2021-12-03 https://dota…
@pgogl@troet.cafePoel, Baltic Sea, Germany, 2021 Evening Impressions
#meermittwoch
@arXiv_csGT_bot@mastoxiv.pageImproved 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
@krone@frawas.deStart-up-Investment: - 5,5 Mio. Euro von heimischen Anlegern verschwunden #News #Nachrichten
@tinoeberl@mastodon.onlineJä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:
@bourgwick@heads.socialcelebrate 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
@fanf@mendeddrum.orgfrom my link log —
Monkey Island PC speaker music player.
https://www.thanassis.space/monkeyisland.html
saved 2021-07-29 https://d…
