Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games (Q5247620): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2110243058 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1402.3610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal network design with selfish agents / 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: The statistical mechanics of strategic interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Network Protocols for Good Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Price of Stability for Undirected Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of selfish behavior in bilateral network formation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Cooperative Solution Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is Shapley Cost Sharing Optimal? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing the cost of multicast transmissions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost spanning tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential, Value, and Consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency Loss in a Network Resource Allocation Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Shapley Value in Supermodular Coalitional Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: State based potential games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Selfishness in Network Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting log-linear learning: asynchrony, completeness and payoff-based implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Welfare Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overcoming the Limitations of Utility Design for Multiagent Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint Strategy Fictitious Play With Inertia for Potential Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4538166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost sharing in a job scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient and almost budget balanced cost sharing method / rank
 
Normal rank
Property / cites work
 
Property / cites work: COST SHARING IN NETWORKS: SOME OPEN QUESTIONS / 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: A Game Theoretic Approach for Efficient Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifying inefficiency in cost-sharing mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions and potentials for normal form games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjectural Equilibrium in Multiuser Power Control Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Shapley value representation of potential games / 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: Q4220399 / rank
 
Normal rank

Latest revision as of 23:53, 9 July 2024

scientific article; zbMATH DE number 6430562
Language Label Description Also known as
English
Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games
scientific article; zbMATH DE number 6430562

    Statements

    Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games (English)
    0 references
    0 references
    0 references
    24 April 2015
    0 references
    cost sharing
    0 references
    game theory
    0 references
    marginal contribution
    0 references
    Nash equilibrium
    0 references
    Shapley value
    0 references
    0 references
    0 references
    0 references

    Identifiers

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