4 citations · 7 across the 8 of their papers we have counts for
5 papers · 1 filter
Equilibria in multiagent online problems with predictions
Gabriel Istrate, Cosmin Bonchiş, Victor Bogdan
We study the power of (competitive) algorithms with predictions in a multiagent setting. To this goal, we introduce a multiagent version of the ski-rental problem. In this problem…
Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games
Gabriel Istrate, Cosmin Bonchiş
We study strategic network formation games in which agents attempt to form (costly) links in order to maximize their network centrality. Our model derives from Jackson and Wolinsky…
It's Not Whom You Know, It's What You (or Your Friends) Can Do: Succint Coalitional Frameworks for Network Centralities
Gabriel Istrate, Cosmin Bonchis, Claudiu Gatina
We investigate the representation of measures of network centrality using a framework that blends a social network representation with the succint formalism of cooperative skill ga…
Attacking Power Indices by Manipulating Player Reliability
Gabriel Istrate, Cosmin Bonchiş, Alin Brînduşescu
We investigate the manipulation of power indices in TU-cooperative games by stimulating (subject to a budget constraint) changes in the propensity of other players to participate t…
A Parametric Worst-Case Approach to Fairness in TU-Cooperative Games
Cosmin Bonchis, Gabriel Istrate
We propose a parametric family of measures of fairness in allocations of TU-cooperative games. Their definition is based on generalized Renyi Entropy, is related to the Cowell-Kuga…