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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Motivated by the common academic problem of allocating papers to referees forconference reviewing we propose a novel mechanism for solving the assignmentproblem when we have a two sided matching problem with preferences from oneside (the agents/reviewers) over the other side (the objects/papers) and bothsides have capacity constraints. The assignment problem is a fundamentalproblem in both computer science and economics with application in many areasincluding task and resource allocation. We draw inspiration from multi-criteriadecision making and voting and use order weighted averages (OWAs) to propose anovel and flexible class of algorithms for the assignment problem. We show analgorithm for finding a $\Sigma$-OWA assignment in polynomial time, in contrastto the NP-hardness of finding an egalitarian assignment. Inspired by thissetting we observe an interesting connection between our model and the classicproportional multi-winner election problem in social choice.

The Conference Paper Assignment Problem: Using Order Weighted Averages to Assign Indivisible Goods