1 citations · 1 across the 5 of their papers we have counts for
7 papers
A Tractability Boundary for Exclusion Zones in Instant-Runoff Voting: Planar Versus One-Apex Graphs
Georgios Birmpas, Georgios Chionas, Efthyvoulos Drousiotis +3
We study exclusion zones for instant-runoff voting (IRV) on connected, unweighted graphs. Each vertex hosts one voter and may host a candidate. Voters rank candidates by shortest-p…
The Contest Game for Crowdsourcing Reviews
Marios Mavronicolas, Paul G. Spirakis
We consider a contest game modelling a contest where reviews for proposals are crowdsourced from strategic agents} players. Player has a skill for reviewing…
(In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations
Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien
We consider 2-players, 2-values minimization games where the players' costs take on two values, , . The players play mixed strategies and their costs are evaluated by uni…
The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games
Vittorio Bilò, Marios Mavronicolas
We revisit the complexity of deciding, given a {\it bimatrix game,} whether it has a {\it Nash equilibrium} with certain natural properties; such decision problems were early known…
The Complexity of Equilibria for Risk-Modeling Valuations
Marios Mavronicolas, Burkhard Monien
We study the complexity of deciding the existence of mixed equilibria for minimization games where players use valuations other than expectation to evaluate their costs. We conside…
A Distributed Algorithm for Gathering Many Fat Mobile Robots in the Plane
Chrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas
In this work we consider the problem of gathering autonomous robots in the plane. In particular, we consider non-transparent unit-disc robots (i.e., fat) in an asynchronous setting…