{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreiehhbswxstrqmmn3uxlnnzd77aplxzjxhqj4my3c6sr3erkcz2ifu",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mj4qkysdl4e2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.08345v1",
  "publishedAt": "2026-04-10T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Hui Liu",
    "Zhijie Zhang"
  ],
  "textContent": "**Authors:** Hui Liu, Zhijie Zhang\n\nThis paper re-examines the problem of fairly and efficiently allocating indivisible goods among agents with additive bivalued valuations. Garg and Murhekar (2021) proposed a polynomial-time algorithm that purported to find an EFX and fPO allocation. However, we provide a counterexample demonstrating that their algorithm may fail to terminate. To address this issue, we propose a new polynomial-time algorithm that computes a WEFX (Weighted Envy-Free up to any good) and fPO allocation, thereby correcting the prior approach and offering a more general solution. Furthermore, we show that our algorithm can be adapted to compute a WEQX (Weighted Equitable up to any good) and fPO allocation.",
  "title": "Revisiting Fair and Efficient Allocations for Bivalued Goods"
}