Strategyproof auction mechanisms for network procurement (Q2215560): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SteinLib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00291-020-00597-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3044331085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm composition scheme preserving monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved LP-based approximation for steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: General network design: a unified view of combined location and network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Performance of Deferred-Acceptance Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in Teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful and Near-Optimal Mechanism Design via Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truth revelation in approximately efficient combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster approximation algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful approximation mechanisms for restricted combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Auction Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for Graph Steiner Tree Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finding the bridges of a graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:23, 24 July 2024

scientific article
Language Label Description Also known as
English
Strategyproof auction mechanisms for network procurement
scientific article

    Statements

    Strategyproof auction mechanisms for network procurement (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 December 2020
    0 references
    Steiner tree problem
    0 references
    network procurement
    0 references
    approximation mechanism
    0 references
    deferred-acceptance auction
    0 references
    0 references
    0 references

    Identifiers