Enforcing efficient equilibria in network design games via subsidies
The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting network satisfies a given set of connectivity r...
Saved in:
Main Authors: | Augustine, John, Caragiannis, Ioannis, Fanelli, Angelo, Kalaitzis, Christos |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/98956 http://hdl.handle.net/10220/12510 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Towards robust and efficient computation in dynamic peer-to-peer networks
by: Upfal, Eli, et al.
Published: (2015) -
Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure
by: Caragiannis, Ioannis, et al.
Published: (2013) -
Game theory based algorithms for community detection
by: Radhika Arava
Published: (2015) -
Efficient implementations of the BP heuristic for the shortest linear program (SLP) problem
by: Liu, Shuqing
Published: (2021) -
On the tradeoff among efficiency, fairness and revenue in resource allocation
by: Hua, Xia
Published: (2012)