893 resultados para coalitional game
Resumo:
We consider a framework in which several service providers offer downlink wireless data access service in a certain area. Each provider serves its end-users through opportunistic secondary spectrum access of licensed spectrum, and needs to pay primary license holders of the spectrum usage based and membership based charges for such secondary spectrum access. In these circumstances, if providers pool their resources and allow end-users to be served by any of the cooperating providers, the total user satisfaction as well as the aggregate revenue earned by providers may increase. We use coalitional game theory to investigate such cooperation among providers, and show that the optimal cooperation schemes can be obtained as solutions of convex optimizations. We next show that under usage based charging scheme, if all providers cooperate, there always exists an operating point that maximizes the aggregate revenue of providers, while presenting each provider a share of the revenue such that no subset of providers has an incentive to leave the coalition. Furthermore, such an operating point can be computed in polynomial time. Finally, we show that when the charging scheme involves membership based charges, the above result holds in important special cases.
Resumo:
We consider a setting in which several operators offer downlink wireless data access services in a certain geographical region. Each operator deploys several base stations or access points, and registers some subscribers. In such a situation, if operators pool their infrastructure, and permit the possibility of subscribers being served by any of the cooperating operators, then there can be overall better user satisfaction, and increased operator revenue. We use coalitional game theory to investigate such resource pooling and cooperation between operators.We use utility functions to model user satisfaction, and show that the resulting coalitional game has the property that if all operators cooperate (i.e., form a grand coalition) then there is an operating point that maximizes the sum utility over the operators while providing the operators revenues such that no subset of operators has an incentive to break away from the coalition. We investigate whether such operating points can result in utility unfairness between users of the various operators. We also study other revenue sharing concepts, namely, the nucleolus and the Shapely value. Such investigations throw light on criteria for operators to accept or reject subscribers, based on the service level agreements proposed by them. We also investigate the situation in which only certain subsets of operators may be willing to cooperate.
Resumo:
Efficacy of commercial wireless networks can be substantially enhanced through large-scale cooperation among involved entities such as providers and customers. The success of such cooperation is contingent upon the design of judicious resource allocation strategies that ensure that the individuals' payoffs are commensurate to the resources they offer to the coalition. The resource allocation strategies depend on which entities are decision-makers and whether and how they share their aggregate payoffs. Initially, we consider the scenario where the providers are the only decision-makers and they do not share their payoffs. We formulate the resource allocation problem as a nontransferable payoff coalitional game and show that there exists a cooperation strategy that leaves no incentive for any subset of providers to split from the grand coalition, i.e., the core of the game is nonempty. To compute this cooperation strategy and the corresponding payoffs, we subsequently relate this game and its core to an exchange market setting and its equilibrium, which can be computed by several efficient algorithms. Next, we investigate cooperation when customers are also decision-makers and decide which provider to subscribe to based on whether there is cooperation. We formulate a coalitional game in this setting and show that it has a nonempty core. Finally, we extend the formulations and results to the cases where the payoffs are vectors and can be shared selectively.
Resumo:
In this paper, we develop a game theoretic approach for clustering features in a learning problem. Feature clustering can serve as an important preprocessing step in many problems such as feature selection, dimensionality reduction, etc. In this approach, we view features as rational players of a coalitional game where they form coalitions (or clusters) among themselves in order to maximize their individual payoffs. We show how Nash Stable Partition (NSP), a well known concept in the coalitional game theory, provides a natural way of clustering features. Through this approach, one can obtain some desirable properties of the clusters by choosing appropriate payoff functions. For a small number of features, the NSP based clustering can be found by solving an integer linear program (ILP). However, for large number of features, the ILP based approach does not scale well and hence we propose a hierarchical approach. Interestingly, a key result that we prove on the equivalence between a k-size NSP of a coalitional game and minimum k-cut of an appropriately constructed graph comes in handy for large scale problems. In this paper, we use feature selection problem (in a classification setting) as a running example to illustrate our approach. We conduct experiments to illustrate the efficacy of our approach.
Resumo:
In this paper we present a solution concept for abstract systems called the admissible hierarchic set. The solution we propose is a refinement of the hierarchic solution, a generalization of the von Neumann and Morgenstern solution. For finite abstract systems we show that the admissible hierarchic sets and the von Neumann and Morgenstern stable sets are the only outcomes of a coalition formation procedure (Wilson, 1972 and Roth, 1984). For coalitional games we prove that the core is either a vN&M stable set or an admissible hierarchic set.
Resumo:
This paper is a version of the discussion paper titled "Simple coalitional strategy profiles"
Resumo:
This paper describes a design game that we called 'Meaning in Movement'. The purpose was to explore notions of professional dental practice with dental practioners in terms of gestures, actions and movements. The game represents a first step towards involving gestures, actions and movements in a design dialog with practioners for the purpose of designing future interactive systems which are more appropriate to the type of skilful actions and richly structured environments of dentists and dental assistants.
Resumo:
Designers need to develop good observational skills in order to conduct user studies that reveal the subtleties of human interactions and adequately inform design activity. In this paper we describe a game format that we have used in concert with wiki-web technology, to engage our IT and Information Environments students in developing much sharper observational skills. The Video Card Game is a method of video analysis that is suited to design practitioners as well as to researchers. It uses the familiar format of a card game similar to "Happy Families,, to help students develop themes of interactions from watching video clips. Students then post their interaction themes on wiki-web pages, which allows the teaching team and other students to edit and comment on them. We found that the tangible (cards), game, role playing and sharing aspects of this method led to a much larger amount of interaction and discussion between student groups and between students and the teaching team, than we have achieved using our traditional teaching methods, while taking no more time on the part of the teaching staff. The quality of the resulting interaction themes indicates that this method fosters development of observational skills.In the paper we describe the motivations, method and results in full. We also describe the research context in which we collected the videotape data, and how this method relates to state of the art research methods in interaction design for ubiquitous computing technology.
Resumo:
In this paper, we present interim results from the Communities and Place project, which is exploring methods for understanding communities in a variety of contexts, and how to inform the design of technology to support them. We report on our experience with adapting an existing game-based approach for working with video as a resource in participatory design processes. Our adaptations allow the approach to be used with diverse data arising out of the different communities we are engaged with, and different design traditions we approach the problem from, leading to the formation of common design themes to inform our future work on this project.
Lesser-known worlds : bridging the telematic flows with located human experience through game design
Resumo:
This paper represents a new theorization of the role of location-based games (LBGs) as potentially playing specific roles in peoples’ access to the culture of cities [22]. A LBG is a game that employs mobile technologies as tools for game play in real world environments. We argue that as a new genre in the field of mobile entertainment, research in this area tends to be preoccupied with the newness of the technology and its commercial possibilities. However, this overlooks its potential to contribute to cultural production. We argue that the potential to contribute to cultural production lies in the capacity of these experiences to enhance relationships between specific groups and new urban spaces. Given that developers can design LBGs to be played with everyday devices in everyday environments, what new creative opportunities are available to everyday people?
Resumo:
This paper explores how we may transform peoples’ perceived access to cultural participation by exploiting the possible relationships between place, play and mobile devices. It presents SCOOT; a location-based game in order to investigate how aspects of game-play can be employed to evoke at once playful and culturally meaningful experiences of place. In particular this paper is concerned with how the portable, communicative and social affordances of mobile phones are integral to making a “now everything looks like a game” experience.
Resumo:
Digital Songlines (DSL) is an Australasian CRC for Interaction Design (ACID) project that is developing protocols, methodologies and toolkits to facilitate the collection, education and sharing of indigenous cultural heritage knowledge. This paper outlines the goals achieved over the last three years in the development of the Digital Songlines game engine (DSE) toolkit that is used for Australian Indigenous storytelling. The project explores the sharing of indigenous Australian Aboriginal storytelling in a sensitive manner using a game engine. The use of the game engine in the field of Cultural Heritage is expanding. They are an important tool for the recording and re-presentation of historically, culturally, and sociologically significant places, infrastructure, and artefacts, as well as the stories that are associated with them. The DSL implementation of a game engine to share storytelling provides an educational interface. Where the DSL implementation of a game engine in a CH application differs from others is in the nature of the game environment itself. It is modelled on the 'country' (the 'place' of their heritage which is so important to the clients' collective identity) and authentic fauna and flora that provides a highly contextualised setting for the stories to be told. This paper provides an overview on the development of the DSL game engine.