Indivisible
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Optimal Online Equitable Allocation with Indivisible Resources
arXiv:2606.08328v1 Announce Type: new Abstract: Equitable allocation of indivisible goods to agents in online settings is an algorithmic primitive with applications for load balancing, network routing, online marketplaces, and multi-agent systems. We consider a general setting in which allocations are constrained to be bases of discrete polymatroids that arrive online. Our work demonstrates that a simple, myopic algorithm called Brick-Laying, which greedily minimizes the sum of squared loads...
Soros-backed nonprofit accuses NJ Gov. Sherrill of spreading 'MAGA propaganda' on ICE detainees
A Soros-backed nonprofit organized a demonstration outside of New Jersey Governor Mikie Sherrill’s office on Monday afternoon, saying the Democratic governor is spreading "MAGA propaganda" and not doing enough for the migrants detained by Immigration and Customs Enforcement (ICE) at Delaney Hall in Newark, N.J.The protest reflected the backlash that Sherrill is facing by far-left members of her own party. On its donation page, Cooper River Indivisible directs donors to the politically...
Soros-backed nonprofit accuses NJ Gov. Sherrill of spreading 'MAGA propaganda' on ICE detainees
A Soros-backed nonprofit organized a demonstration outside of New Jersey Governor Mikie Sherrill’s office on Monday afternoon, saying the Democratic governor is spreading "MAGA propaganda" and not doing enough for the migrants detained by Immigration and Customs Enforcement (ICE) at Delaney Hall in Newark, N.J.The protest reflected the backlash that Sherrill is facing by far-left members of her own party. On its donation page, Cooper River Indivisible directs donors to the politically...
Secret Signal chats reveal how anti-ICE agitators coordinated Newark riots
At 11:30 a.m. on June 3, an activation signal went out on social media calling protesters and agitators to swarm Delaney Hall, the Newark, N.J. ICE detention facility that has become one of the nation's most contentious immigration battlegrounds. BACK TO DELANEY," read an Instagram post, promoted by a fiery collection of anti-Israel, Marxist and Democratic organizations — from "Palestine Solidarity Working Group" and Al-Awda to Indivisible and 50501 — that have joined tumultuous against the...
Secret Signal chats reveal how anti-ICE agitators coordinated Newark riots
At 11:30 a.m. on June 3, an activation signal went out on social media calling protesters and agitators to swarm Delaney Hall, the Newark, N.J. ICE detention facility that has become one of the nation's most contentious immigration battlegrounds. BACK TO DELANEY," read an Instagram post, promoted by a fiery collection of anti-Israel, Marxist and Democratic organizations — from "Palestine Solidarity Working Group" and Al-Awda to Indivisible and 50501 — that have joined tumultuous against the...
Optimizing the Envy Cycle Elimination Algorithm
arXiv:2606.02233v1 Announce Type: new Abstract: In the fair allocation of indivisible goods, a widely used notion of fairness is envy-freeness up to one good (EF1). A classical way to compute an EF1 allocation is the envy cycle elimination (ECE) algorithm, which iteratively assigns a good to an unenvied agent and, after each assignment, resolves any resulting envy cycle. Although the ECE algorithm always produces an EF1 allocation, it leaves considerable freedom in choosing both the next...
Generalized binary utility functions and fair allocations
arXiv:2109.08461v2 Announce Type: replace Abstract: The problem of finding envy-free allocations of indivisible goods can not always be solved; therefore, it is common to study some relaxations such as envy-free up to one good (EF1). Another property of interest for efficiency of an allocation is the Pareto Optimality (PO). Under additive utility functions, it is possible to find allocations EF1 and PO using Nash social welfare.
Improved Approximation Guarantees for Groupwise Maximin Share Fairness
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...
Simultaneous EF1 and approximate MMS allocations for submodular valuations
Announce Type: new Abstract: There are two common classes of fairness notions that are considered when allocating $m$ indivisible items to $n$ agents of equal entitlements. One is that of share-based fairness notions, with the maximin share (MMS) and its relaxations to $\rho$-MMS being prominent representatives of this class. The other is that of comparison-based fairness notions, with envy-freeness (EF) and its relaxations such as EF1 being prominent representatives of this class.
Best-of-Both-Worlds Fairness of the Envy-Cycle-Elimination Algorithm
arXiv:2410.08986v2 Announce Type: replace Abstract: We consider the problem of fairly dividing indivisible goods among agents with additive valuations. It is known that an Epistemic EFX and $2/3$-MMS allocation can be obtained using the Envy-Cycle-Elimination (ECE) algorithm. In this work, we explore whether this algorithm can be randomized to also ensure ex-ante proportionality.