activity
20102014
most citedCooperative oligopoly games with boundedly rational firms

13 citations · 19 across the 9 of their papers we have counts for

collaborators

9 papers

cs.GT2014

An Evolutionary Approach to Coalition Formation

Paraskevas V. Lekeas

In Cooperative Games with Externalities when the members of a set S \subset N of agents wish to deviate they need to calculate their worth. This worth depends on what the non-membe…

cs.DS2012

A Note on Circular Arc Online Coloring using First Fit

Paraskevas V. Lekeas

In Raman (2007), using a column construction technique it is proved that every interval graph can be colored online with First Fit with at most colors, where is the…

cs.GT2012

Coalitional Beliefs of Cournot Network Agents

Paraskevas V. Lekeas

In Network cooperative games, due to computational complexity issues, agents are not able to base their behavior on the "whole network status" but have to follow certain "beliefs"…

cs.GT2012★ 1 cited

Should I quit using my resource? Modeling Resource Usage through Game Theory

Paraskevas V. Lekeas

Existing web infrastructures have supported the publication of a tremendous amount of resources, and over the past few years Data Resource Usage is an everyday task for millions of…

cs.GT2012★ 13 cited

Cooperative oligopoly games with boundedly rational firms

Paraskevas V. Lekeas, Giorgos Stamatopoulos

We analyze cooperative Cournot games with boundedly rational firms. Due to cogni- tive constraints, the members of a coalition cannot accurately predict the coalitional structure o…

cs.GT2011

Cooperative oligopoly games: a probabilistic approach

Paraskevas V. Lekeas, Giorgos Stamatopoulos

We analyze the core of a cooperative Cournot game. We assume that when contemplating a deviation, the members of a coalition assign positive probability over all possible coalition…

cs.GT2011★ 3 cited

Strategic delegation in a sequential model with multiple stages

Paraskevas V. Lekeas, Giorgos Stamatopoulos

We analyze strategic delegation in a Stackelberg model with an arbitrary number, n, of firms. We show that the n-1 last movers delegate their production decisions to managers where…

cs.DB2010

A New Framework for Join Product Skew

Foto Afrati, Victor Kyritsis, Paraskevas V. Lekeas +1

Different types of data skew can result in load imbalance in the context of parallel joins under the shared nothing architecture. We study one important type of skew, join product…

cs.DB2010★ 2 cited

Managing Semantic Loss during Query Reformulation in Peer Data Management Systems

Yannis Delveroudis, Paraskevas V. Lekeas

In this paper we deal with the notion of semantic loss in Peer Data Management Systems (PDMS) queries. We define such a notion and we give a mechanism that discovers semantic loss…