Orestis A. Telelis

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On envy-free revenue approximation for combinatorial buyers with budgets Theory of Computing Systems	2021-06-11	Paper
Tight welfare guarantees for pure Nash equilibria of the uniform price auction Theory of Computing Systems	2019-09-05	Paper
Tight welfare guarantees for pure Nash equilibria of the uniform price auction Algorithmic Game Theory	2018-02-13	Paper
Item bidding for combinatorial public projects Theoretical Computer Science	2017-05-15	Paper
Strategic scheduling games: equilibria and efficiency Just-in-Time Systems	2017-02-03	Paper
Item Pricing for Combinatorial Public Projects Algorithmic Aspects in Information and Management	2016-11-09	Paper
Envy-free revenue approximation for asymmetric buyers with budgets Algorithmic Game Theory	2016-09-29	Paper
The strong price of anarchy of linear bottleneck congestion games Theory of Computing Systems	2016-01-28	Paper
Uniform price auctions: equilibria and efficiency Theory of Computing Systems	2016-01-13	Paper
Mechanisms for multi-unit combinatorial auctions with a few distinct goods Journal of Artificial Intelligence Research	2015-10-29	Paper
Inefficiency of standard multi-unit auctions Lecture Notes in Computer Science	2013-09-17	Paper
Labeled traveling salesman problems: complexity and approximation Discrete Optimization	2013-05-31	Paper
Uniform price auctions: equilibria and efficiency Algorithmic Game Theory	2013-03-13	Paper
Externalities among Advertisers in Sponsored Search Algorithmic Game Theory	2011-10-28	Paper
Probabilistic models for the Steiner tree problem Networks	2010-11-24	Paper
On the inefficiency of equilibria in linear bottleneck congestion games Algorithmic Game Theory	2010-10-19	Paper
Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity Information Processing Letters	2010-04-19	Paper
Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis Information Processing Letters	2009-12-04	Paper
Improved Bounds for Facility Location Games with Fair Cost Allocation Combinatorial Optimization and Applications	2009-07-07	Paper
Steiner Forests on Stochastic Metric Graphs Combinatorial Optimization and Applications	2009-03-03	Paper
On Labeled Traveling Salesman Problems Algorithms and Computation	2009-01-29	Paper
Updating Directed Minimum Cost Spanning Trees Experimental Algorithms	2007-09-14	Paper

Research outcomes over time

This page was built for person: Orestis A. Telelis