Orestis Telelis

Apostolos Ntokos

Theory Comput. Syst., 2020

2019

Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Parallel and Distributed Processing of Reverse Top-k Queries.

[BibT_eX]

[DOI]

Panagiotis Nikitopoulos

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2017

Item bidding for combinatorial public projects.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

2016

Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Item Pricing for Combinatorial Public Projects.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

Uniform Price Auctions: Equilibria and Efficiency.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

The Strong Price of Anarchy of Linear Bottleneck Congestion Games.

[BibT_eX]

[DOI]

Bart de Keijzer

Guido Schäfer

Theory Comput. Syst., 2015

Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods.

[BibT_eX]

[DOI]

Carmine Ventre

J. Artif. Intell. Res., 2015

User recruitment for mobile crowdsensing over opportunistic networks.

[BibT_eX]

[DOI]

Merkourios Karaliopoulos

Iordanis Koutsopoulos

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Near-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions.

[BibT_eX]

[DOI]

Carmine Ventre

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2013

Inefficiency of Standard Multi-unit Auctions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

2012

On the Inefficiency of the Uniform Price Auction

[BibT_eX]

[DOI]

CoRR, 2012

Limited Supply Online Auctions for Revenue Maximization.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

2011

Externalities among Advertisers in Sponsored Search.

[BibT_eX]

[DOI]

Dimitris Fotakis

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010

Probabilistic models for the Steiner Tree problem.

[BibT_eX]

[DOI]

Vangelis Th. Paschos

Networks, 2010

Labeled Traveling Salesman Problems: Complexity and approximation.

[BibT_eX]

[DOI]

Discret. Optim., 2010

Discrete Strategies in Keyword Auctions and Their Inefficiency for Locally Aware Bidders.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games.

[BibT_eX]

[DOI]

Bart de Keijzer

Guido Schäfer

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009

Selfish Scheduling with Setup Times.

[BibT_eX]

[DOI]

Laurent Gourvès

Jérôme Monnot

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Improved Bounds for Facility Location Games with Fair Cost Allocation.

[BibT_eX]

[DOI]

Thomas Dueholm Hansen

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

Dynamic bottleneck optimization for k-edge and 2-vertex connectivity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

On Pure and (Approximate) Strong Equilibria of Facility Location Games.

[BibT_eX]

[DOI]

Thomas Dueholm Hansen

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

On the Social Cost of Distributed Selfish Content Replication.

[BibT_eX]

[DOI]

Gerasimos G. Pollatos

Proceedings of the NETWORKING 2008, Ad Hoc and Sensor Networks, Wireless Networks, 2008

On Labeled Traveling Salesman Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Steiner Forests on Stochastic Metric Graphs.

[BibT_eX]

[DOI]

Vangelis Th. Paschos

Proceedings of the Combinatorial Optimization and Applications, 2007

2006

Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι

[BibT_eX]

[DOI]

PhD thesis, 2006

Distributed Selfish Replication.

[BibT_eX]

[DOI]

Nikolaos Laoutaris

Ioannis Stavrakakis

IEEE Trans. Parallel Distributed Syst., 2006

Updating Directed Minimum Cost Spanning Trees.

[BibT_eX]

[DOI]

Gerasimos G. Pollatos

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2005

Absolute o(log m) error in approximating random set covering: an average case analysis.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Local Utility Aware Content Replication.

[BibT_eX]

[DOI]

Nikolaos Laoutaris

Ioannis Stavrakakis

Proceedings of the NETWORKING 2005: Networking Technologies, 2005

2002

Guiding Constructive Search with Statistical Instance-Based Learning.

[BibT_eX]

[DOI]

Panagiotis Stamatopoulos

Int. J. Artif. Intell. Tools, 2002

2001

Combinatorial Optimization through Statistical Instance-Based Learning.

[BibT_eX]

[DOI]