Back to results
University of Illinois at Urbana-Champaign
Reduced Complexity Mechanisms for Network Resource Allocation
Abstract
dc:descriptionFinally, we show that the VCG-Kelly mechanism can be applied to reduce the complexity of a combinatorial auction if the users' valuation functions satisfy the strong substitute condition. We investigate the properties of substitute functions. The sufficient and necessary condition for a function to be substitute appears quite strong and network users' valuation functions are not substitute generally.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Electrical and Computer Engineering
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Yang, Sichao
- Contributors dc:contributor
-
- Hajek, Bruce
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI3290441
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/81050