5 citations · 10 across the 9 of their papers we have counts for
11 papers
Belief-Aware Pivotal Mechanism for DAO Committees
Nuno Braz, Miguel Correia, Diogo Poças
Decentralized Autonomous Organizations (DAOs) increasingly delegate decisions to small committees whose members hold two independent kinds of private information: idiosyncratic pre…
Simple grammar bisimilarity, with an application to session type equivalence
Diogo Poças, Gil Silva, Vasco T. Vasconcelos
We provide an algorithm for deciding simple grammar bisimilarity whose complexity is polynomial in the valuation of the grammar (maximum seminorm among production rules). Since the…
Higher-order Context-free Session Types in System F
Diana Costa, Andreia Mordido, Diogo Poças +1
We present an extension of System F with higher-order context-free session types. The mixture of functional types with session types has proven to be a challenge for type equivalen…
The Different Shades of Infinite Session Types
Simon J. Gay, Diogo Poças, Vasco T. Vasconcelos
Many type systems include infinite types. In session type systems, which are the focus of this paper, infinite types are important because they allow the specification of communica…
On the Complexity of Equilibrium Computation in First-Price Auctions
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender +2
We consider the problem of computing a (pure) Bayes-Nash equilibrium in the first-price auction with continuous value distributions and discrete bidding space. We prove that when b…
A Unifying Approximate Potential for Weighted Congestion Games
Yiannis Giannakopoulos, Diogo Poças
We provide a unifying, black-box tool for establishing existence of approximate equilibria in weighted congestion games and, at the same time, bounding their Price of Stability. Ou…
A New Lower Bound for Deterministic Truthful Scheduling
Yiannis Giannakopoulos, Alexander Hammerl, Diogo Poças
We study the problem of truthfully scheduling tasks to selfish unrelated machines, under the objective of makespan minimization, as was introduced in the seminal work of Ni…
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games
George Christodoulou, Martin Gairing, Yiannis Giannakopoulos +2
We study the existence of approximate pure Nash equilibria (-PNE) in weighted atomic congestion games with polynomial cost functions of maximum degree . Previously it was kno…
Robust Revenue Maximization Under Minimal Statistical Information
Yiannis Giannakopoulos, Diogo Poças, Alexandros Tsigonias-Dimitriadis
We study the problem of multi-dimensional revenue maximization when selling items to a buyer that has additive valuations for them, drawn from a (possibly correlated) prior dis…
Optimal Pricing For MHR and -Regular Distributions
Yiannis Giannakopoulos, Diogo Poças, Keyu Zhu
We study the performance of anonymous posted-price selling mechanisms for a standard Bayesian auction setting, where bidders have i.i.d. valuations for a single item. We show t…
Approximability in the GPAC
Diogo Poças, Jeffery Zucker
Most of the physical processes arising in nature are modeled by either ordinary or partial differential equations. From the point of view of analog computability, the existence of…