Emergency connectivity in ad-hoc networks with selfish nodes

DOI10.1007/S00453-012-9675-XzbMATH Open1308.68022OpenAlexW2058404798MaRDI QIDQ476427FDOQ476427

Authors: George Karakostas, Euripides Markou 

Publication date: 2 December 2014

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-012-9675-x

Recommendations

• Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes
• Near-optimal network design with selfish agents
• Near-optimal network design with selfish agents
• Designing network protocols for good equilibria
• On the topologies formed by selfish peers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Other game-theoretic models (91A40) Games involving graphs (91A43) Network protocols (68M12)

Cites Work

• Geometric algorithms and combinatorial optimization

Cited In (1)

• Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes

This page was built for publication: Emergency connectivity in ad-hoc networks with selfish nodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476427)