2014
DOI: 10.1007/978-3-642-54830-7_8
View full text
|
|
Share

Abstract: Classical network-formation games are played on a directed graph. Players have reachability objectives: each player has to select a path from his source to target vertices. Each edge has a cost, shared evenly by the players using it. We introduce and study network-formation games with regular objectives. In our setting, the edges are labeled by alphabet letters and the objective of each player is a regular language over the alphabet of labels. Unlike the case of reachability objectives, here the paths selecte…

Expand abstract

Search citation statements

Order By: Relevance

Citation Types

0
4
0

Paper Sections

0
0
0
0
0

Publication Types

0
0
0
0

Relationship

0
0

Authors

Journals