An improved approximation algorithm for MULTIWAY CUT
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Different Look at Secure Distributed Computation
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Proceedings of the twenty-second annual symposium on Principles of distributed computing
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
Mathematics of Operations Research
On nash equilibria for a network creation game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Network design with weighted players
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
Journal of Computer and System Sciences
Cut problems in graphs with a budget constraint
Journal of Discrete Algorithms
Strong equilibrium in cost sharing connection games
Proceedings of the 8th ACM conference on Electronic commerce
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Designing networks with good equilibria
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmica
The Price of Stability for Network Design with Fair Cost Allocation
SIAM Journal on Computing
Price of Stability in Survivable Network Design
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On Strong Equilibria in the Max Cut Game
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Strategic cooperation in cost sharing games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Convergence and approximation in potential games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Geometric network design with selfish agents
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the price of stability for designing undirected networks with fair cost allocations
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Non-cooperative facility location and covering games
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Strategic cooperation in cost sharing games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
| Hi-index | 0.00 |
We consider cut games where players want to cut themselves off from different parts of a network. These games arise when players want to secure themselves from areas of potential infection. For the game-theoretic version of Multiway Cut, we prove that the price of stability is 1, i.e., there exists a Nash equilibrium as good as the centralized optimum. For the game-theoretic version of Multicut, we show that there exists a 2-approximate equilibrium as good as the centralized optimum. We also give poly-time algorithms for finding exact and approximate equilibria in these games.