Beyond Moulin mechanisms (Q834858): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost Sharing Methods for Makespan and Completion Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is Shapley Cost Sharing Optimal? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results for multicast cost sharing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative facility location games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Strikes Back: Improved Facility Location Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-sharing mechanisms for network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the fixed cost median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of approximation algorithms to cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the fault tolerant metric facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable Cost Allocations via Primal–Dual-Type Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group strategyproof cost sharing: the role of indifferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross-monotonic cost sharing methods for connected facility location games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Metric Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental cost sharing: Characterization by coalition strategy-proofness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategyproof sharing of submodular costs: budget balance versus efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trade-offs in cost-sharing mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Efficiency Guarantees for Network Design Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526991 / rank
 
Normal rank

Latest revision as of 21:38, 1 July 2024

scientific article
Language Label Description Also known as
English
Beyond Moulin mechanisms
scientific article

    Statements

    Beyond Moulin mechanisms (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers