@vosje62@mastodon.nl2026-01-09 05:27:32
@servelan@newsie.social2025-12-08 17:35:06
Trump’s Katrina Is Coming - The American Prospect
https://prospect.org/2025/12/05/trumps-katrina-is-coming-fema/
@arXiv_csGT_bot@mastoxiv.page2025-12-09 07:47:37
The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders
Frederick V. Qiu, S. Matthew Weinberg, Qianfan Zhang
https://arxiv.org/abs/2512.06585 https://arxiv.org/pdf/2512.06585 https://arxiv.org/html/2512.06585
arXiv:2512.06585v1 Announce Type: new
Abstract: We study the communication complexity of welfare maximization in combinatorial auctions with bidders from either a standard valuation class (which require exponential communication to explicitly state, such as subadditive or XOS), or arbitrary succinct valuations (which can be fully described in polynomial communication, such as single-minded). Although succinct valuations can be efficiently communicated, we show that additional succinct bidders have a nontrivial impact on communication complexity of classical combinatorial auctions. Specifically, let $n$ be the number of subadditive/XOS bidders. We show that for SA $\cup$ SC (the union of subadditive and succinct valuations): (1) There is a polynomial communication $3$-approximation algorithm; (2) As $n \to \infty$, there is a matching $3$-hardness of approximation, which (a) is larger than the optimal approximation ratio of $2$ for SA, and (b) holds even for SA $\cup$ SM (the union of subadditive and single-minded valuations); and (3) For all $n \geq 3$, there is a constant separation between the optimal approximation ratios for SA $\cup$ SM and SA (and therefore between SA $\cup$ SC and SA as well). Similarly, we show that for XOS $\cup$ SC: (1) There is a polynomial communication $2$-approximation algorithm; (2) As $n \to \infty$, there is a matching $2$-hardness of approximation, which (a) is larger than the optimal approximation ratio of $e/(e-1)$ for XOS, and (b) holds even for XOS $\cup$ SM; and (3) For all $n \geq 2$, there is a constant separation between the optimal approximation ratios for XOS $\cup$ SM and XOS (and therefore between XOS $\cup$ SC and XOS as well).
toXiv_bot_toot
@memeorandum@universeodon.com2026-01-08 20:05:58
'Largest economic development in history': $20 billion dollar data center coming to Southaven (Hannah Kozlowski/Action News 5)
https://www.actionnews5.com/2026/01/08/largest-economic-development-history-20-billion-dollar-data-center-coming-southaven/
http://www.memeorandum.com/260108/p106#a260108p106
@NFL@darktundra.xyz2025-12-08 13:05:49
Liam Coen is 'totally fine' with Jaguars not getting respect: 'That's the beauty of it. It ain't coming.' https://www.nfl.com/news/liam-coen-is-totally-fine-with-jaguars-not-getting-respect-that-s-t…
@Techmeme@techhub.social2026-01-08 00:50:48
Ford plans to launch an AI voice assistant on its apps this year before expanding to its vehicles in 2027, and aims to debut Level 3 autonomous driving in 2028 (Andrew J. Hawkins/The Verge)
https://www.theverge.com/transportation/857400/ford-ai-as…
@cowboys@darktundra.xyz2026-01-08 14:06:34
Cowboys Headlines: Ohio State coming to Dallas? Jerry talks Super Bowl https://cowboyswire.usatoday.com/story/sports/nfl/cowboys/2026/01/08/jerry-jones-hints-at-ma…
@kexpmusicbot@mastodonapp.uk2026-02-07 10:33:03
🇺🇦 #NowPlaying on KEXP's #MechanicalBreakdown
Patriarchy:
🎵 Coming Up
#Patriarchy
https://patriarchy.bandcamp.com/track/coming-up
https://open.spotify.com/track/35xajnbGwbIiPf0QBU0O68
@metacurity@infosec.exchange2026-02-06 22:56:32
Ahead of the Munich Security Conference, Google issued a call for action to secure the quantum computing era
https://blog.google/innovation-and-ai/technology/safety-security/the-quantum-era-is-coming-are-we-ready-to-secure-…
@kexpmusicbot@mastodonapp.uk2025-12-08 17:29:30
🇺🇦 #NowPlaying on KEXP's #MorningShow
World News:
🎵 Everything Is Coming up Roses
#WorldNews
https://worldnewsband.bandcamp.com/track/everything-is-coming-up-roses
https://open.spotify.com/track/3AXBbn0MhwKPGJOZFcmiHD