Designing Cost-Sharing Methods for Bayesian Games (Q2819469): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal Coordination Mechanisms for Multi-job Scheduling Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Stability for Network Design with Fair Cost Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination Mechanisms for Selfish Routing over Time on a Tree / 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: Designing Network Protocols for Good Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian Combinatorial Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the price of anarchy for selfish routing via coordination mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Networks with Good Equilibria under Uncertainty / 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: Optimal Cost Sharing for Resource Selection Games / 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: Combinatorial walrasian equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Auctions via Posted Prices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Cost-Sharing in Weighted Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Covering with Our Eyes Closed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walrasian equilibrium with gross substitutes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games with Incomplete Information Played by “Bayesian” Players Part II. Bayesian Equilibrium Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Matching, Coalition Formation, and Gross Substitutes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games / 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: Local smoothness and the price of anarchy in splittable congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant Approximation Algorithm for the a priori Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler and better derandomization of an approximation algorithm for single source rent-or-buy / rank
 
Normal rank

Latest revision as of 15:51, 12 July 2024

scientific article
Language Label Description Also known as
English
Designing Cost-Sharing Methods for Bayesian Games
scientific article

    Statements

    Designing Cost-Sharing Methods for Bayesian Games (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2016
    0 references
    price of anarchy
    0 references
    Bayesian games
    0 references
    network design
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references