1 citations · 1 across the 4 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2025
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners
Ivan Geffner, Erez Karpas, Moshe Tennenholtz
The inefficiency of selfish routing in congested networks is a classical problem in algorithmic game theory, often captured by the Price of Anarchy (i.e., the ratio between the soc…
cs.GT2022
Mediated Cheap Talk Design (with proofs)
Itai Arieli, Ivan Geffner, Moshe Tennenholtz
We study an information design problem with two informed senders and a receiver in which, in contrast to traditional Bayesian persuasion settings, senders do not have commitment po…
cs.GT2021★ 1 cited
Lower Bounds Implementing Mediators in Asynchronous Systems
Ivan Geffner, Joseph Y. Halpern
Abraham, Dolev, Geffner, and Halpern proved that, in asynchronous systems, a -robust equilibrium for players and a trusted mediator can be implemented without the mediat…