@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
@cowboys@darktundra.xyz2025-10-09 01:09:07
Mick Shots: Talk about coming out of nowhere https://www.dallascowboys.com/news/mick-shots-talk-about-coming-out-of-nowhere
@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…
@raiders@darktundra.xyz2025-10-09 17:21:42
Bucky's Breakdown: Why the Raiders keep coming up short on gameday https://www.raiders.com/news/bucky-s-breakdown-why-the-raiders-keep-coming-up-short-on-gameday
@Techmeme@techhub.social2026-01-09 14:20:57
Sources say DeepSeek will launch its next-generation V4 model in the coming weeks and claim it outperformed Anthropic's Claude and OpenAI's GPT series in coding (The Information)
https://www.theinformation.com/articles/deepseek-re…
@PaulWermer@sfba.social2025-11-08 23:33:45
Please sign this petition
I'm a chemist. As a grad student I was a TA and a tutor. I taught college chemistry classes.
That's teaching a subject, not communicating about a technical issue (yes, these really are different skills)
And climate change advocacy has highlighted how difficult communicating is.
I wish this proposal had been enacted when I was a student.
Please sign.
@cowboys@darktundra.xyz2025-10-09 00:23:40
Mick Shots: Talk about coming out of nowhere https://www.dallascowboys.com/news/mick-shots-talk-about-coming-out-of-nowhere