Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians

doi 10.1137/1.9781611975994.166
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

On the Existence of Pure Strategy Nash Equilibria in Integer–Splittable Weighted Congestion Games

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Restoring Pure Equilibria to Weighted Congestion Games

ACM Transactions on Economics and Computation
StatisticsProbabilityMarketingEconomicsComputer ScienceComputational MathematicsEconometrics
2015English

Selfish Load Balancing and Atomic Congestion Games

2004English

Weighted Graph Laplacians and Isoperimetric Inequalities

Pacific Journal of Mathematics
Mathematics
2000English

Weighted Distance Maps Computation on Parametric Three-Dimensional Manifolds

Journal of Computational Physics
Numerical AnalysisApplied MathematicsSimulationComputer Science ApplicationsModelingComputational MathematicsAstronomyPhysics
2007English

Subjective Games and Equilibria

Games and Economic Behavior
EconomicsEconometricsFinance
1995English

Nash Equilibria in Random Games

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

Strict Nash Equilibria in Non-Atomic Games With Strict Single Crossing in Players (Or Types) and Actions

Economic Theory Bulletin
2015English

Rationalizability and Nash Equilibria in Guessing Games

SSRN Electronic Journal
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy