English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Many important collective decision-making problems can be seen as multi-agentversions of discrete optimisation problems. Participatory budgeting, forinstance, is the collective version of the knapsack problem; other examplesinclude collective scheduling, and collective spanning trees. Rather thandeveloping a specific model, as well as specific algorithmic techniques, foreach of these problems, we propose to represent and solve them in the unifyingframework of judgment aggregation with weighted issues. We provide a modulardefinition of collective discrete optimisation (CDO) rules based on coupling aset scoring function with an operator, and we show how they generalise severalexisting procedures developed for specific CDO problems. We also give animplementation based on integer linear programming (ILP) and test it on theproblem of collective spanning trees.

Collective discrete optimisation as judgment aggregation