Pages that link to "Item:Q2436693"

The following pages link to A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693):

Displaying 12 items.

• Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
• Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
• Strategy-proofness of scoring allocation correspondences for indivisible goods (Q1707112) (← links)
• Local fairness in hedonic games via individual threshold coalitions (Q2034790) (← links)
• The price to pay for forgoing normalization in fair division of indivisible goods (Q2202518) (← links)
• Effective deadlock resolution with self-interested partially-rational agents (Q2254627) (← links)
• Exploration costs as a means for improving performance in multiagent systems (Q2254629) (← links)
• A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
• Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
• Duplication monotonicity in the allocation of indivisible goods (Q5145454) (← links)
• Generalized graph \(k\)-coloring games (Q5918905) (← links)