scholarly journals Algorithms for deletion problems on split graphs

2021 ◽  
Vol 167 ◽  
pp. 106066
Author(s):  
Dekel Tsur
Keyword(s):  
2016 ◽  
Vol 32 (4) ◽  
pp. 1005-1014
Author(s):  
Jian-hua Yin ◽  
Lei Meng ◽  
Meng-Xiao Yin
Keyword(s):  

2021 ◽  
pp. 189-206
Author(s):  
Karen L. Collins ◽  
Ann N. Trenk
Keyword(s):  

Games ◽  
2021 ◽  
Vol 12 (3) ◽  
pp. 55
Author(s):  
Markus Kinateder ◽  
Luca Paolo Merlino

In this paper, we propose a game in which each player decides with whom to establish a costly connection and how much local public good is provided when benefits are shared among neighbors. We show that, when agents are homogeneous, Nash equilibrium networks are nested split graphs. Additionally, we show that the game is a potential game, even when we introduce heterogeneity along several dimensions. Using this result, we introduce stochastic best reply dynamics and show that this admits a unique and stationary steady state distribution expressed in terms of the potential function of the game. Hence, even if the set of Nash equilibria is potentially very large, the long run predictions are sharp.


2010 ◽  
Vol 39 (17) ◽  
Author(s):  
Sheila de Almeida ◽  
Celia de Mello ◽  
Aurora Morgana
Keyword(s):  

2015 ◽  
Vol 21 (3) ◽  
pp. 284-287
Author(s):  
Yumei Hu ◽  
Tingting Liu

1994 ◽  
Vol 52 (3) ◽  
pp. 307-312 ◽  
Author(s):  
Frédéric Maffray ◽  
Myriam Preissmann
Keyword(s):  

2021 ◽  
Vol 8 (1) ◽  
pp. 120-124
Author(s):  
Xuan Hung Xuan Hung
Keyword(s):  

2019 ◽  
Vol 12 (4-5) ◽  
pp. 1179-1185
Author(s):  
Litao Guo ◽  
◽  
Bernard L. S. Lin ◽  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document