Zobrazeno 1 - 10
of 70
pro vyhledávání: '"Poças, Diogo"'
In multi-agent systems, strong connectivity of the communication network is often crucial for establishing consensus protocols, which underpin numerous applications in decision-making and distributed optimization. However, this connectivity requireme
Externí odkaz:
http://arxiv.org/abs/2411.06880
Autor:
Poças, Diogo, Vasconcelos, Vasco T.
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 valuation is at most exponential in the size of the grammar, this giv
Externí odkaz:
http://arxiv.org/abs/2407.04063
We study increasingly expressive type systems, from $F^\mu$ -- an extension of the polymorphic lambda calculus with equirecursive types -- to $F^{\mu;}_\omega$ -- the higher-order polymorphic lambda calculus with equirecursive types and context-free
Externí odkaz:
http://arxiv.org/abs/2301.08659
Publikováno v:
EPTCS 356, 2022, pp. 24-35
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 equivalence formalization: whereas functional type equivalence is often rule-ba
Externí odkaz:
http://arxiv.org/abs/2203.12877
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 communication protocols that are unbounded in time. Usually infinite session ty
Externí odkaz:
http://arxiv.org/abs/2201.08275
Publikováno v:
In Theoretical Computer Science 27 June 2024 1001
Autor:
Filos-Ratsikas, Aris, Giannakopoulos, Yiannis, Hollender, Alexandros, Lazos, Philip, Poças, Diogo
Publikováno v:
SIAM Journal on Computing, 52(1):80-131 (2023)
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 bidders have independent subjective prior beliefs about the value distr
Externí odkaz:
http://arxiv.org/abs/2103.03238
Autor:
Giannakopoulos, Yiannis, Poças, Diogo
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. Our framework can handle resources with general costs--including, in par
Externí odkaz:
http://arxiv.org/abs/2005.10101
We study the problem of truthfully scheduling $m$ tasks to $n$ selfish unrelated machines, under the objective of makespan minimization, as was introduced in the seminal work of Nisan and Ronen [STOC'99]. Closing the current gap of $[2.618,n]$ on the
Externí odkaz:
http://arxiv.org/abs/2005.10054
Autor:
Christodoulou, George, Gairing, Martin, Giannakopoulos, Yiannis, Poças, Diogo, Waldmann, Clara
We study the existence of approximate pure Nash equilibria ($\alpha$-PNE) in weighted atomic congestion games with polynomial cost functions of maximum degree $d$. Previously it was known that $d$-approximate equilibria always exist, while nonexisten
Externí odkaz:
http://arxiv.org/abs/2002.07466