Towards a game theoretic understanding of ad-hoc routing
From MaRDI portal
Publication:2849565
Recommendations
- A Game-Theoretic Approach to Routing under Adversarial Conditions
- Game-theoretic approach for modeling of selfish and group routing
- A game-theoretic approach to compute stable topologies in mobile ad hoc networks
- Coalition Games and Resource Allocation in Ad-Hoc Networks
- scientific article; zbMATH DE number 7042410
Cited in
(9)- A Game-Theoretic Approach to Routing under Adversarial Conditions
- Double best response dynamics in topology formation game for ad hoc networks
- A game-theoretic approach to compute stable topologies in mobile ad hoc networks
- A game-theoretic analysis of cooperation in anonymity networks
- A game theoretic approach for optimal network topologies in opportunistic networks
- Performance analysis of a cooperative flow game algorithm in ad hoc networks and a comparison to Dijkstra's algorithm
- Frugal Routing on Wireless Ad-Hoc Networks
- A game-theoretic algorithm for non-linear single-path routing problems
- Studying on economic-inspired mechanisms for routing and forwarding in wireless ad hoc network
This page was built for publication: Towards a game theoretic understanding of ad-hoc routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849565)