Switch to: References

Add citations

You must login to add citations.
  1. Fair and efficient allocation with few agent types, few item types, or small value levels.Trung Thanh Nguyen & Jörg Rothe - 2023 - Artificial Intelligence 314 (C):103820.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • On social envy-freeness in multi-unit markets.Michele Flammini, Manuel Mauro & Matteo Tonelli - 2019 - Artificial Intelligence 269 (C):1-26.
  • Envy-free allocations respecting social networks.Robert Bredereck, Andrzej Kaczmarczyk & Rolf Niedermeier - 2022 - Artificial Intelligence 305 (C):103664.
  • Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity.Haris Aziz, Péter Biró, Ronald de Haan & Baharak Rastegari - 2019 - Artificial Intelligence 276 (C):57-78.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • How to construct Remainder Sets for Paraconsistent Revisions: Preliminary Report.Rafael Testa, Eduardo Fermé, Marco Garapa & Maurício Reis - 2018 - 17th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING.
    Revision operation is the consistent expansion of a theory by a new belief-representing sentence. We consider that in a paraconsistent setting this desideratum can be accomplished in at least three distinct ways: the output of a revision operation should be either non-trivial or non-contradictory (in general or relative to the new belief). In this paper those distinctions will be explored in the constructive level by showing how the remainder sets could be refined, capturing the key concepts of paraconsistency in a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation