Filters








141 Hits in 3.1 sec

Selfish Distributed Compression over Networks: Correlation Induces Anarchy [article]

Aditya Ramamoorthy, Vwani Roychowdhury, Sudhir Kumar Singh
2009 arXiv   pre-print
We consider the min-cost multicast problem (under network coding) with multiple correlated sources where each terminal wants to losslessly reconstruct all the sources.  ...  Our main result is that in contrast with the case of independent sources, the presence of source correlations can significantly increase the price of anarchy.  ...  induce anarchy?  ... 
arXiv:0804.1840v2 fatcat:nbuk6dly45auznb7bidrzjwjv4

Selfish Distributed Compression Over Networks: Correlation Induces Anarchy

Aditya Ramamoorthy, Vwani P. Roychowdhury, Sudhir K. Singh
2012 IEEE Transactions on Information Theory  
This can be considered as the network generalization of the classical distributed source coding (Slepian-Wolf) problem.  ...  Our main result is that in contrast with the case of independent sources, the presence of source correlations can significantly increase the price of anarchy.  ...  induce anarchy?  ... 
doi:10.1109/tit.2012.2184660 fatcat:nrz3msobd5gfhm2twvwmsdt4iu

Selfish Distributed Compression over Networks

A. Ramamoorthy, V. Roychowdhury, S. K. Singh
2009 IEEE INFOCOM 2009 - The 28th Conference on Computer Communications  
This can be considered as the network generalization of the classical distributed source coding (Slepian-Wolf) problem.  ...  Our main result is that in contrast with the case of independent sources, the presence of source correlations can significantly increase the price of anarchy.  ...  induce anarchy?  ... 
doi:10.1109/infcom.2009.5062277 dblp:conf/infocom/RamamoorthyRS09 fatcat:xn6oc54j4res3eceuopjcli5lu

Antagonistic Phenomena in Network Dynamics

Adilson E. Motter, Marc Timme
2018 Annual Review of Condensed Matter Physics  
They include effects as diverse as negative compressibility in engineered materials, rescue interactions in biological networks, negative resistance in fluid networks, and the Braess paradox occurring  ...  across transport and supply networks.  ...  chooses to be selfish, in which case everyone loses.  ... 
doi:10.1146/annurev-conmatphys-033117-054054 pmid:30116502 pmcid:PMC6089548 fatcat:5yseeytghvfxtit4lmqyj3o5rq

Game Theory for Signal Processing in Networks [article]

Giacomo Bacci, Samson Lasaulce, Walid Saad, Luca Sanguinetti
2015 arXiv   pre-print
One of the main features of this contribution is to gather in a single paper some fundamental game-theoretic notions and tools which, over the past few years, have become widely spread over a large number  ...  Moreover, a particular attention is also devoted to clarify the connections between strategic-form games and distributed optimization and learning algorithms.  ...  loss induced by decentralization.  ... 
arXiv:1506.00982v3 fatcat:oktiyibtrjhxzgexsz4blb4f3i

Common Interest Tragedies

Lee Anne Fennell
2003 Social Science Research Network  
See supra note 208 (noting the difficulty property theory has in explaining how selfish parties can cooperate to a sufficient degree to establish property rights that are designed to restrain selfishness  ...  Perhaps the holdin's tastes seem so idiosyncratic or selfish as to make her refusal to deal appear unfair.  ... 
doi:10.2139/ssrn.474380 fatcat:i74tvec3bjdqveewqbwc3fco7u

Power Allocation Games in Interference Relay Channels: Existence Analysis of Nash Equilibria

ElenaVeronica Belmega, Brice Djeumou, Samson Lasaulce
2010 EURASIP Journal on Wireless Communications and Networking  
We consider a network composed of two interfering point-to-point links where the two transmitters can exploit one common relay node to improve their individual transmission rate.  ...  Conf. on Game Theory for Networks (GAMENETS), Istanbul, Turkey, May 2009 [17] .  ...  is, knowing that the destination also receives a direct signal from the source, that is, correlated with the signal to be compressed.  ... 
doi:10.1155/2010/583462 fatcat:qurplvqcdneszdh4fad2znyaae

Game Theory for Networks: A tutorial on game-theoretic tools for emerging signal processing applications

Giacomo Bacci, Samson Lasaulce, Walid Saad, Luca Sanguinetti
2016 IEEE Signal Processing Magazine  
However, the real catalyzer of the application of GT to signal processing (SP) has been the blooming of all issues related to networking in general, and distributed networks, in particular.  ...  One of the main features of this contribution is to gather in a single paper some fundamental game-theoretic notions and tools which, over the past few years, have become widely spread over a large number  ...  the performance loss induced by decentralization.  ... 
doi:10.1109/msp.2015.2451994 fatcat:mur5pyjsbzf33hzts3lx4yxeiy

Algorithmic foundations of the internet

Alejandro López-Ortiz
2005 ACM SIGACT News  
. * c Alejandro López-Ortiz, 2005. 1 This should not be confused with the well established field of Queuing Theory which has traditionally been the source of theoretical foundations for communication networks  ...  Figure 1 : 1 Web page access path over the network. Figure 2 : 2 Network of distribution paths for a single server.  ...  At the same time, this is not to say that anarchy reigns on the Internet.  ... 
doi:10.1145/1067309.1067322 fatcat:pboilnujfng3faxqrsqmjxdewy

Fear of Oversight: The Fundamental Failure of Business-like Government

Steven L. Schooner
2001 Social Science Research Network  
Professor John Cibinic described the current situation as "virtual anarchy."  ...  One person's selfish special interest is another's vital national priority. Id. 186.  ... 
doi:10.2139/ssrn.283369 fatcat:74rww4jgnjd3dolca3d6tz3nw4

Multiagent systems: algorithmic, game-theoretic, and logical foundations

2009 ChoiceReviews  
1.3.2 A simple example 12 1.3.3 An extended example: the four queens problem 13 1.3.4 Beyond the ABT algorithm 17 1.4 History and references 18 2 Distributed Optimization 19 2.1 Distributed dynamic programming  ...  two-player, general-sum games 108 4.5 Identifying dominated strategies 108 4.5.1 Domination by a pure strategy 109 4.5.2 Domination by a mixed strategy 110 4.5.3 Iterated dominance 112 4.6 Computing correlated  ...  Selfish routing and the price of anarchy Selfish routing is a model of how self-interested agents would route traffic through selfish routing a congested network.  ... 
doi:10.5860/choice.46-5662 fatcat:pr2pmv7k2bad3pp5bxgogecgnq

Power Allocation Games in Interference Relay Channels: Existence Analysis of Nash Equilibria [article]

E. V. Belmega, S. Lasaulce
2011 arXiv   pre-print
We consider a network composed of two interfering point-to-point links where the two transmitters can exploit one common relay node to improve their individual transmission rate.  ...  from the source that is correlated with the signal to be compressed.  ...  The price of anarchy [12] is analyzed in such a scenario. In [10] , a quite similar analysis is conducted for multi-hop networks.  ... 
arXiv:1101.2192v1 fatcat:2xju6wd7wzdynbup3vmfj4lehu

Game theoretic methods for networked sensors and dynamic spectrum access

Michael Maskery
2007
policies in a game with noisy, correlated measurements.  ...  networks, and cognitive radio wireless communications.  ...  The selfish (anarchy) case, α 1 = α 2 = 0, does not yield the best system performance, but left to their own devices radios may gravitate towards this case.  ... 
doi:10.14288/1.0066179 fatcat:bbzq6i4ftjaibbe5udyqihhkym

Cross-layer adaptive transmission scheduling in wireless networks

Minh Hanh Ngo
2007
A new promising approach for wireless network optimization is from a cross-layer perspective.  ...  The first part of the thesis considers exploiting CSI via a distributed channel-aware MAC protocol.  ...  over a correlated fading channel The FSMC channel model is used to represent the correlated fading channel.  ... 
doi:10.14288/1.0066600 fatcat:wwukqamrnjdczlhcbwhonjrfc4

User-Centric Radio Access Technology Selection: A Survey of Game Theory Models and Multi-Agent Learning Algorithms

Giuseppe Caso, Ozgu Alay, Guido Carlo Ferrante, Luca De Nardis, Maria-Gabriella Di Benedetto, Anna Brunstrom
2021 IEEE Access  
A review of centralized vs. hybrid vs. distributed RAT selection can be found in [9]- [11] .  ...  These solutions, referred to as hybrid and distributed usercentric schemes, address the scalability issues of centralized schemes, while putting more emphasis on user satisfaction (why).  ...  Definition 7 (Price of anarchy (stability) -PoA (PoS) [248] [249]).  ... 
doi:10.1109/access.2021.3087410 fatcat:xjqicfhgdfgy3n6ffss7ppvn44
« Previous Showing results 1 — 15 out of 141 results