The Generalized Shapley Value of Cooperative Games as a Social Preference Function

2023 | Group Decision and Negotiation | Citations: 0

Authors: Dutta, Ritu; Roy, Souvik; Borkotokey, Surajit

Abstract: We introduce a cardinal social preference rule (CSPR) which accounts for interpe ... Expand

Abstract: We introduce a cardinal social preference rule (CSPR) which accounts for interpersonal comparisons of alternatives in groups and satisfies several desirable properties. The proposed rule transforms voters’ individual ordinal preferences to obtain a score for each alternative given by the generalized Shapley value of cooperative games with transferable utilities. Since every CSPR induces an ordinal social preference rule (OSPR) in a natural way, the score vector, we propose in our model, induces a weak preference on the set of alternatives. The proposed CSPR is characterized by using some intuitive axioms. Collapse

Topics: shapley additive explanation

Theories: game theory cooperative game theory

An Abortion Based Search Method for Optimal Coalition Structure Generation

2022 | Group Decision and Negotiation | Citations: 0

Authors: Narayan, Changder; Samir, Aknine; Animesh, Dutta

Abstract: The Coalition Structure Generation (CSG) problem is a partitioning of a set of a ... Expand

Abstract: The Coalition Structure Generation (CSG) problem is a partitioning of a set of agents into exhaustive and disjoint subsets to maximize social welfare. This NP-complete problem arises in many practical scenarios. Prominent examples are included in the field of transportation, e-Commerce, distributed sensor networks, and others. The fastest exact algorithm to solve the CSG problem is ODP-IP, which is a hybrid version of two previously established algorithms, namely Improved Dynamic Programming (IDP) and IP. In this paper, we show that the ODP-IP algorithm performs many redundant operations. To improve ODP-IP, we propose a faster abortion mechanism to speed up IP’s search. Our abortion mechanism decides at runtime which of the IP’s operations are redundant to skip them. Then, we propose a modified version of IDP (named MIDP) and an improved version of IP (named IIP). Based on these two improved algorithms, we develop a hybrid version (MIDP-IIP) to solve the CSG problem. After a detailed description of the new algorithm MIDP-IIP, an experimental comparison is conducted against ODP-IP. Our analysis shows that MIDP-IIP performs fewer operations than ODP-IP. In addition, MIDP-IIP reduced significantly many problem instances running times (11–37%). Collapse

Topics: Java

Methods: computational algorithm experiment literature study dynamic programming

Theories: cooperative game theory

Peak cubes in service operations: Bringing multidimensionality into decision support systems

2021 | Decision Support Systems | Citations: 0

Authors: Barfar, Arash; Padmanabhan, Balaji; Hevner, Alan

Abstract: Companies like Ritz Carlton, Disney and Verizon are among many who have invested ... Expand

Abstract: Companies like Ritz Carlton, Disney and Verizon are among many who have invested in analytics to improve their customers’ service experiences with the firms. Extensive data are collected on all aspects of how customers interact or experience the products or services. Research has shown the importance of the “peak-end” rule in service design; that is, providing a customer with good “peak” service levels and “ending” the service experience with high quality can enhance customer satisfaction and build loyalty. However, previous studies have examined this phenomenon only in contexts with unidimensional service levels. We introduce peak cubes, which enable service designers and scholars to pinpoint prominent service levels in multidimensional service experience pro­ files—thereby extending current research on behavioral economics and service design to more general settings. Results indicate the potential of multidimensional peak-end models to better predict customer satisfaction in various service scenarios. Using Shapley values in coalitional game theory, the resulting models can also inform service designers about the quality dimensions that are critical from the perspective of multidimensional peakend heuristic and customer satisfaction. Our research contributions and proposed methodology will enhance decision support systems with multidimensional capabilities and have applications to fields as diverse as service operations and healthcare. Collapse

Topics: service quality shapley additive explanation logistics management customer satisfaction database system

Methods: simulation computational algorithm time series analysis longitudinal research LightGBM

Theories: behavioral economics theory of bounded rationality game theory cooperative game theory

A Non-cooperative Game-Theoretic Approach for Conflict Resolution in Multi-agent Planning

2021 | Group Decision and Negotiation | Citations: 0

Authors: Jordán, Jaume; Torreño, Alejandro; de Weerdt, Mathijs; Onaindia, Eva

Abstract: This paper presents FENOCOP, a game-theoretic approach for solving non-cooperati ... Expand

Abstract: This paper presents FENOCOP, a game-theoretic approach for solving non-cooperative planning problems that involve a set of self-interested agents. Each agent wants to execute its own plan in a shared environment but the plans may be rendered infeasible by the appearance of potential conflicts; agents are willing to coordinate their plans in order to avoid conflicts during a joint execution. In order to attain a conflict-free combination of plans, agents must postpone the execution of some of their actions, which negatively affects their individual utilities. FENOCOP is a two-level game approach: the General Game selects a Nash equilibrium among several combinations of plans, and the Scheduling Game generates, for a combination of plans, an executable outcome by introducing delays in the agents’ plans. For the Scheduling Game, we developed two algorithms that return a Pareto optimal and fair equilibrium from which no agent would be willing to deviate. Collapse

Methods: computational algorithm experiment cross sectional research

Theories: game theory cooperative game theory

Relational Embeddedness, Breadth of Added Value Opportunities, and Business Growth

2021 | Organization Science | Citations: 0

Authors: Mawdsley, John K.; Somaya, Deepak

Abstract: The current paper complements and extends traditional Penrosean theories of firm ... Expand

Abstract: The current paper complements and extends traditional Penrosean theories of firm growth by examining how a (supplier) firm’s relational embeddedness with its portfolio of existing buyers affects its business growth. Our theorizing rests on the foundation that a firm’s business growth stems from its breadth (or volume) of opportunities for creating added value with buyers, which more fully realizes the Penrosean vision that firm growth can be explained by a dynamic interaction between productive resources and demand-side market opportunities. Although relational embeddedness may give a supplier dyadic advantages with focal buyers, which supports business growth, we theorize that it can also lead to narrower added value business opportunities with the supplier’s entire portfolio of buyers. Critically, we hypothesize that the effect of relational embeddedness on business growth is moderated by a set of relational and demand-side attributes. These hypotheses are tested on a panel data set of patent law firms (suppliers) and their relationships with corporate clients (buyers). We find that greater relational embeddedness is associated with slower supplier business growth, and consistent with our hypotheses, this negative effect is alleviated when these firms have greater cross-servicing ability and receive more relational commitment from buyers but exacerbated when suppliers hold more buyer-specific knowledge and when buyers undertake more (internal) concurrent sourcing. In turn, our research demonstrates how the attributes of a supplier’s relationships with its portfolio of buyers can impact access to new business opportunities and thus opens up new directions for research on firm growth, demand-side strategy and buyer-supplier relationships. Collapse

Topics: insourcing interorganizational relationship outsourcing business-to-consumer value creation

Methods: longitudinal research theory development robustness check descriptive statistic statistical hypothesis test

Theories: transaction cost economics behavioral theory cooperative game theory

Selecting the Best Subset of Features Using a Game-theoretic Approach: Applications in Information Systems

2020 | Americas Conference on Information Systems | Citations: 0

Authors: Keshanian, Kimia; Dutta, Kaushik

Abstract: The curse of dimensionality is a major issue in datasets related to Information ... Expand

Abstract: The curse of dimensionality is a major issue in datasets related to Information Systems (IS) because of the volume of data coming from smartphones, cameras, wireless sensory networks, social media, Internet search, etc. For such datasets applying a proper feature selection method can boost the performance of prediction or classification methods. While there are many feature selection techniques that can be used in the IS domain, the performance of them is problem-specific and they may not perform well on many datasets. Therefore, in this study, we address this issue by developing a novel method that employs ideas from the field of game theory. A computational study on real-life classification IS datasets shows that our proposed method outperforms or do as well as other benchmarks. Collapse

Topics: online review internet technology website web page economic surplus

Methods: support vector machine optimization model linear regression analysis Internet Movie Database review machine learning

Theories: game theory cooperative game theory

A Non-cooperative Mechanism Yielding the Nucleolus of Airport Problems

2018 | Group Decision and Negotiation | Citations: 0

Authors: Albizuri, M. J.; Echarri, J. M.; Zarzuelo, J. M.

Abstract: A non-cooperative approach is employed to solve the problem of allocating the to ... Expand

Abstract: A non-cooperative approach is employed to solve the problem of allocating the total cost of building and maintaining an airport runway among its users. More precisely, it is proposed a non-cooperative bargaining game with a unique subgame perfect equilibrium (SPE) outcome, and it is shown that the SPE outcome payoffs coincide with those prescribed by the nucleolus of the corresponding airport cooperative game. Collapse

Topics: shapley additive explanation

Methods: computational algorithm

Theories: cooperative game theory

Digital Information Asset Evaluation: A Case Study in Manufacturing

2018 | ACM SIGMIS Database | Citations: 2

Authors: Batini, Carlo; Castelli, Marco; Viscusi, Gianluigi; Cappiello, Cinzia; Francalanci, Chiara

Abstract: The article discusses a model for information value assessment based on the conc ... Expand

Abstract: The article discusses a model for information value assessment based on the concepts of information capacity, information utility, and information management costs. Notwithstanding that both state-of-the-art researchers and practitioners consider information as a fundamental asset, there is actually no consensus on what are the determinants of information value, particularly with regard to the increasing number of data available through digitalized processes and services. The model is applied to a case study comparing two information management projects for the improvement of core business processes of a global manufacturing company based in Italy. Collapse

Topics: database system information management radio frequency identification business process management computer hardware

Methods: case study data modeling design science design artifact mixed method

Theories: cooperative game theory

The Generalized Nash Bargaining Solution for Transfer Price Negotiations Under Incomplete Information

2018 | Group Decision and Negotiation | Citations: 0

Authors: Haake, Claus-Jochen; Recker, Sonja

Abstract: In our model two divisions negotiate over type-dependent contracts to determine ... Expand

Abstract: In our model two divisions negotiate over type-dependent contracts to determine an intrafirm transfer price for an intermediate product. Since the upstream division’s (seller’s) costs and downstream division’s (buyer’s) revenues are supposed to be private information, we formally consider cooperative bargaining problems under incomplete information. This means that the two divisions consider allocations of expected utility generated by mechanisms that satisfy (interim) individual rationality, incentive compatibility and/or ex post efficiency. Assuming two possible types for buyer and seller each, we first establish that the bargaining problem is regular, regardless whether or not incentive and/or efficiency constraints are imposed. This allows us to apply the generalized Nash bargaining solution to determine fair transfer payments and transfer quantities. In particular, the generalized Nash bargaining solution tries to balance divisional profits, while incentive constraints are still in place. In that sense a fair profit division is generated. Furthermore, by means of illustrative examples we derive general properties of this solution for the transfer pricing problem and compare the model developed here with the models existing in the literature. We demonstrate that there is a tradeoff between ex post efficiency and fairness. Collapse

Topics: price management privacy pricing information system

Theories: cooperative game theory

Kingpins, Bottlenecks, and Value Dynamics Along a Sector

2015 | Organization Science | Citations: 4

Authors: Jacobides, Michael G.; Tae, C. Jennifer

Abstract: This paper explores the dynamics of value distribution within a sector, using da ... Expand

Abstract: This paper explores the dynamics of value distribution within a sector, using data on the U.S. computer industry as an illustration. It provides exploratory quantitative evidence for the way in which conditions within the segments of a sector’s value chain affect the profitability of those segments compared with the sector as a whole. To consider how value shifts from one part of the sector (such as computer assemblers) to another (such as software and microprocessor makers), we look at how conditions within a segment (such as software developers) affect changes in the value share of that segment compared with the entire sector in terms of market capitalization. We find that the presence of what we call “kingpins”—firms with superior capabilities, modeled in our study as having superior market capitalization and as being disproportionately important in terms of research and development (R&D)—is correlated with a higher share of total sector value, suggesting that kingpins can help a segment to become a “bottleneck.” Sales concentration and the level of R&D expenditure are not always reliable predictors. Kingpins exert a positive externality on their direct competitors, yet their segments display increasing internal inequality over time, making the presence of kingpins a double-edged sword for their peers. Our findings extend recent work on industry architectures, highlighting the interconnectedness of different segments within a sector. They also provide a structure to help study the dynamics of “value migration,” which has not yet attracted much academic scrutiny. Collapse

Topics: research and development armed conflict innovation management technological change software developer

Methods: longitudinal research statistical hypothesis test robustness check Compustat autocorrelation analysis

Theories: economic theory cooperative game theory