Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph.
Nina ChiarelliClément DallardAndreas DarmannStefan LendlMartin MilanicPeter MursicUlrich PferschyPublished in: CoRR (2023)
Keyphrases
- optimal allocation
- social welfare
- combinatorial auctions
- graph representation
- random walk
- structured data
- graph theory
- directed acyclic graph
- graph structure
- envy free
- spanning tree
- graph model
- bipartite graph
- directed graph
- social networks
- graph matching
- decision making
- resource allocation
- bayesian networks
- information systems
- allocation problems
- graph based algorithm
- graph construction
- special case
- maximum number
- multi criteria
- connected components
- weighted graph
- user satisfaction