On complexity of single-minded auction
type: Item
instance of: scholarly article
title: On complexity of single-minded auction
zbMATH Open document ID: 1076.68046
author: Ning Chen
author: Xiaotie Deng
author: Xiaoming Sun
published in: Journal of Computer and System Sciences
publication date: 2005-02-23T00:00:00Z
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91B26
Mathematics Subject Classification ID: 91B52
zbMATH DE Number: 2137326
zbMATH Keywords: Combinatorial auctions
zbMATH Keywords: Single-minded auction
zbMATH Keywords: Time complexity
zbMATH Keywords: Communication complexity
MaRDI profile type: Publication
full work available at URL: j.jcss.2004.04.012
OpenAlex ID: W2056772150
Wikidata QID: Q106376688
cites work: Q4471296
cites work: Existence of an Equilibrium for a Competitive Economy
cites work: Competitive equilibrium in an exchange economy with indivisibilities
cites work: Q4420996
cites work: Combinatorial auctions: a survey
cites work: Algorithmic Aspects of the Core of Combinatorial Optimization Games
cites work: On the Complexity of Cooperative Solution Concepts
cites work: On the complexity of equilibria
cites work: Q4198056
cites work: Q4952603
cites work: Walrasian equilibrium with gross substitutes
cites work: Job Matching, Coalition Formation, and Gross Substitutes
cites work: Communication Complexity
cites work: Combinatorial auctions with decreasing marginal utilities
cites work: Truth revelation in approximately efficient combinatorial auctions
cites work: Q4902563
cites work: Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
cites work: The assignment game. I: The core
cites work: On rational computability and communication complexity
DOI: 10.1016/J.JCSS.2004.04.012
description: scientific article; zbMATH DE number 2137326