scientific article

zbMath1183.68570MaRDI QIDQ3624140

Jérôme Lang, Sylvain Bouveret

Publication date: 28 April 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

allocation problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (30)

Envy-free allocations respecting social networks ⋮ Approximating Nash social welfare under binary XOS and binary subadditive valuations ⋮ Distributed fair allocation of indivisible goods ⋮ Multi-unit assignment under dichotomous preferences ⋮ The complexity of computing minimal unidirectional covering sets ⋮ Approximate competitive equilibrium with generic budget ⋮ Dividing bads under additive utilities ⋮ Compactly representing utility functions using weighted goals and the Max aggregator ⋮ Fair and efficient allocation with few agent types, few item types, or small value levels ⋮ Parameterized complexity of envy-free resource allocation in social networks ⋮ Almost Envy-Freeness with General Valuations ⋮ Stable matching with multilayer approval preferences: approvals can be harder than strict preferences ⋮ Computing welfare-maximizing fair allocations of indivisible goods ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ Fair assignment of indivisible objects under ordinal preferences ⋮ Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem ⋮ Stable matching with multilayer approval preferences: approvals can be harder than strict preferences ⋮ Maximizing Social Welfare in Score-Based Social Distance Games ⋮ Modelling incomplete information in Boolean games using possibilistic logic ⋮ Fair allocation of indivisible goods: the two-agent case ⋮ Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods ⋮ Handling preferences in student-project allocation ⋮ Coalition formation in social environments with logic-based agents1 ⋮ Fair Division ⋮ The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases ⋮ The efficiency of fair division ⋮ Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity ⋮ A general branch-and-bound algorithm for fair division problems ⋮ Computing a small agreeable set of indivisible items ⋮ Worst case compromises in matroids with applications to the allocation of indivisible goods

This page was built for publication: