scientific article
From MaRDI portal
Publication:3379036
zbMath1152.91455MaRDI QIDQ3379036
Jérôme Lang, Nicolas Maudet, Paulo Sousa, Yann Chevaleyre, Michel Lemaître, Ulle Endriss, Julian A Padget, Steve Phelps, Juan A. Rodríguez-Aguilar, Paul E. Dunne
Publication date: 6 April 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Auctions, bargaining, bidding and selling, and other market models (91B26) Individual preferences (91B08) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Social choice (91B14)
Related Items
Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach ⋮ Distributed coordination of emergency medical service for angioplasty patients ⋮ Maximizing Nash product social welfare in allocating indivisible goods ⋮ Distributed fair allocation of indivisible goods ⋮ Sequential resource allocation with constraints: two-customer case ⋮ Distant Group Responsibility in Multi-agent Systems ⋮ Compactly representing utility functions using weighted goals and the Max aggregator ⋮ Multi resource allocation with partial preferences ⋮ Multi-agent task allocation under unrestricted environments ⋮ Fair assignment of indivisible objects under ordinal preferences ⋮ Sharing Rewards Among Strangers Based on Peer Evaluations ⋮ A note on the undercut procedure ⋮ The price to pay for forgoing normalization in fair division of indivisible goods ⋮ A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation ⋮ Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods ⋮ Fair division of indivisible items between two players: design parameters for contested pile methods ⋮ Flexibility of planar graphs -- sharpening the tools to get lists of size four ⋮ Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies ⋮ The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases ⋮ Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity ⋮ A general branch-and-bound algorithm for fair division problems ⋮ Local fairness in hedonic games via individual threshold coalitions ⋮ Optimizing social welfare in social networks ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ Fair cake-cutting among families ⋮ Argument-Based Decision Making and Negotiation in E-Business: Contracting a Land Lease for a Computer Assembly Plant ⋮ Multicommodity Allocation for Dynamic Demands Using PageRank Vectors ⋮ Empathetic decision making in social networks ⋮ A formal analysis of interest-based negotiation ⋮ How to share a cake with a secret agent ⋮ Cake cutting: explicit examples for impossibility results ⋮ Multisorted tree-algebras for hierarchical resources allocation ⋮ Sequential Resource Allocation for Nonprofit Operations