activity
20122025
most citedA Parametric Worst-Case Approach to Fairness in TU-Cooperative Games

4 citations · 9 across the 13 of their papers we have counts for

collaborators

18 papers

cs.MA2025

On multiagent online problems with predictions

Gabriel Istrate, Cosmin Bonchis, Victor Bogdan

We study the power of (competitive) algorithms with predictions in a multiagent setting. We introduce a two predictor framework, that assumes that agents use one predictor for thei…

cs.GT2024★ 1 cited

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…

cs.GT2022

Mechanism Design With Predictions for Obnoxious Facility Location

Gabriel Istrate, Cosmin Bonchis

We study mechanism design with predictions for the obnoxious facility location problem. We present deterministic strategyproof mechanisms that display tradeoffs between robustness…

cs.CV2021

Dilated filters for edge detection algorithms

Ciprian Orhei, Victor Bogdan, Cosmin Bonchis

Edges are a basic and fundamental feature in image processing, that are used directly or indirectly in huge amount of applications. Inspired by the expansion of image resolution an…

cs.CC2021

Kernelization, Proof Complexity and Social Choice

Gabriel Istrate, Cosmin Bonchis, Adrian Craciun

We display an application of the notions of kernelization and data reduction from parameterized complexity to proof complexity: Specifically, we show that the existence of data red…

cs.GT2020

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…