Browsing by Subject "Game theory"
Now showing items 120 of 67

Conference Object
4G converged environment: Modeling network selection as a game
(2007)Network Selection mechanism in 4G mobile networks is a newly introduced mechanism that handles the selection of the best network to satisfy a service request. Network Selection needs to take part prior to admission of the ...

Article
Access network synthesis game in next generation networks
(2009)In next generation communication networks, multiple access networks will coexist on a common service platform. In cases where network resource planning indicates that individual access network resources are insufficient ...

Conference Object
Algorithmic mechanisms for internet supercomputing under unreliable communication
(2011)This work, using a gametheoretic approach, considers Internetbased computations, where a master processor assigns, over the Internet, a computational task to a set of untrusted worker processors, and collects their ...

Conference Object
Algorithmic mechanisms for internetbased masterworker computing with untrusted and selfish workers
(2010)We consider Internetbased masterworker computations, where a master processor assigns, across the Internet, a computational task to a set of untrusted worker processors, and collects their responses

Article
Approximate Equilibria and Ball Fusion
(2003)We consider selfish routing over a network consisting of m parallel links through which n selfish users route their traffic trying to minimize their own expected latency. We study the class of mixed strategies in which the ...

Article
Brief announcement: Algorithmic mechanisms for internetbased computing under unreliable communication
(2011)This work, using a gametheoretic approach, considers Internetbased computations, where a master processor assigns, over the Internet, a computational task to a set of untrusted worker processors, and collects their ...

Conference Object
A catalog of ∃ℝcomplete decision problems about Nash equilibria in multiplayer games
(Schloss Dagstuhl LeibnizZentrum fur Informatik GmbH, Dagstuhl Publishing, 2016)[Schaefer and Štefankovic, Theory of Computing Systems, 2015] provided an explicit formulation of ∃ℝ as the class capturing the complexity of deciding the Existential Theory of the Reals, and established that deciding, ...

Conference Object
Characterization of the Optimal Disturbance Attenuation for Nonlinear Stochastic Uncertain Systems
(2003)This paper is concerned with an abstract formulation of stochastic optimal control systems, in which uncertainty is described by a relative entropy constraint between the nominal measure and the uncertain measure, while ...

Book
Competitive Strategy : Options and Games
(The MIT Press, 2011)Corporate managers who face both strategic uncertainty and market uncertainty confront a classic tradeoff between commitment and flexibility. They can stake a claim by making a large capital investment today, influencing ...

Article
The complexity of decision problems about nash equilibria in winlose games
(2012)We revisit the complexity of deciding, given a (finite) strategic game, whether Nash equilibria with certain natural properties exist

Article
Complexity of rational and irrational Nash equilibria
(2011)We introduce two new decision problems, denoted as ∃ RATIONAL NASH and ∃ IRRATIONAL NASH, pertinent to the rationality and irrationality, respectively, of Nash equilibria for (finite) strategic games. These problems ask, ...

Article
Complexity of rational and irrational nash equilibria
(2014)We introduce two new natural decision problems, denoted as ∃ RATIONAL NASH and ∃ IRRATIONAL NASH, pertinent to the rationality and irrationality, respectively, of Nash equilibria for (finite) strategic games. These problems ...

Article
Computing Nash equilibria for scheduling on restricted parallel links
(2010)We consider the problem of routing nusers on m parallel links under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. So, this problem is equivalent to the ...

Article
Conditional valueatrisk: Structure and complexity of equilibria
(2017)Conditional ValueatRisk, denoted as CVaRα, is becoming the prevailing measure of risk over two paramount economic domains: the insurance domain and the financial domain

Article
Congestion games with playerspecific constants
(2007)We consider a special case of weighted congestion games with playerspecific latency functions where each player uses for each particular resource a fixed (nondecreasing) delay function together with a playerspecific ...

Conference Object
Cooperation among access points for enhanced quality of service in dense wireless environments
(Institute of Electrical and Electronics Engineers Inc., 2014)The high popularity of WiFi technology for wireless access has led to a common problem of densely deployed access points (APs) in residential or commercial buildings, competing to use the same or overlapping frequency ...

Doctoral Thesis Open Access
Cooperative interactions in converged heterogeneous communication networks
(Πανεπιστήμιο Κύπρου, Σχολή Θετικών και Εφαρμοσμένων Επιστημών / University of Cyprus, Faculty of Pure and Applied Sciences, 201005)Τα δίκτυα πρόσβασης που συμμετέχουν στα Δίκτυα Επικοινωνίας Επόμενης Γενιάς έχουν διαφορετικά χαρακτηριστικά και ικανότητες, ενθαρρύνοντας τη διαφοροποίηση του χειρισμού της μεταφοράς από τον χειρισμού του περιεχομένου ...

Article
Cooperative usernetwork interactions in next generation communication networks
(2010)Next Generation Communication Networks employ the idea of convergence, where heterogeneous access technologies may coexist, and a user may be served by anyone of the participating access networks, motivating the emergence ...

Article
A cost mechanism for fair pricing of resource usage
(2005)We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand

Article
Cost sharing mechanisms for fair pricing of resource usage
(2008)We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand