The Smart Property Investor
This series is for the Smart Property Investor looking to get an edge in Australia's ever-evolving property market...
Great Australian Pods Podcast Directory: https://www.greataustralianpods.com/the-smart-property-investor/…
Remarks as Prepared:
Mayor Mamdani Delivers Address Marking America’s 250th Birthday
https://www.nyc.gov/mayors-office/news/2026/07/remarks-as-prepared--mayor-mamdani-delivers-address-marking-amer
Report: "Understanding How Proportional Representation Might Work in New York City" (Santucci/voteguy.com)
https://www.voteguy.com/2026/06/04/report-understanding-how-proportional-representation-might-work-in-new-york-city/
http://www.memeorandum.com/260604/p78#a260604p78
Alibaba releases Qwen3.7-Plus, a multimodal proprietary model with a 1M-token context window, costing $2 per 1M tokens, 60% less than text-only Qwen3.7-Max (Carl Franzen/VentureBeat)
https://venturebeat.com/technology/a…
Non-obvious Manipulability in the Additively Separable Group Activity Selection Problem
Maria Fomenko (Gran Sasso Science Institute), Giovanna Varricchio (University of Calabria)
https://arxiv.org/abs/2606.05048 https://arxiv.org/pdf/2606.05048 https://arxiv.org/html/2606.05048
arXiv:2606.05048v1 Announce Type: new
Abstract: In this work, we study the additively separable Group Activity Selection Problem (AS-GASP) in an imperfect information setting, where agents have private preferences over activities and weights over other agents. Our goal is to design mechanisms that assign agents to activities based on their declared preferences and weights, with the objective of maximizing social welfare while ensuring truthful reporting. We, therefore, focus on the notion of non-obvious manipulability (NOM), a form of resilience to manipulation. We first investigate the relationship between NOM and social welfare optimality. In this regard, our main result shows that, when preferences and weights are arbitrary or non-negative, any optimal mechanism is non-obviously manipulable. In contrast, when either preferences or weights are binary, we show that optimality and NOM may be incompatible. We then turn to computational aspects. While it is known that computing an optimal outcome for the AS-GASP is NP-hard even in restricted settings, we establish a strong inapproximability result showing that no polynomial-time algorithm can guarantee a bounded approximation ratio when preferences and weights may take arbitrary values. In turn, when preferences are non-negative, we show that a bounded approximation is possible, and we present two asymptotically optimal approximation mechanisms that are also guaranteed to satisfy NOM.
toXiv_bot_toot
Slowly learning Flatpaks are not the preferred option for Linux GUI apps. The sandboxing causes a lot more problem than it solves. AppImages preferred, or native packages (rpm/dpkg).
Eric Swalwell Sent Women 'Videos of Him Masturbating' and Other Perverted Messages After Joining Snapchat to Restore 'Faith' in 'Democracy': Report (Charlie Nash/Mediaite)
https://www.mediaite.com/politics/eric-swalwell-sent-women-videos-of-him-masturbating-and-other-perverted-messages-after-joining-snapchat-to-restore-faith-in-democracy-report/
http://www.memeorandum.com/260504/p68#a260504p68
Honeycomb, which offers an AI-powered insurance platform for multi-unit residential properties, raised $40M led by Zeev, bringing its total funding to $95M (Lily Mae Lazarus/Fortune)
https://fortune.com/2026/06/04/honeycomb-insurance-ai-apartments-40-million/
Intel taps Alex Katouzian, an ex-Qualcomm EVP, to lead Client Computing & Physical AI group, and names Pushkar Ranade as CTO, after serving on an interim basis (Dylan Martin/CRN)
https://www.crn.com/news/components-periph