A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Filters
Computing a Profit-Maximizing Sequence of Offers to Agents in a Social Network
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
We focus on how to optimally introduce a new product into a social network of agents, when that product has significant externalities. ...
Firms have ever-increasing amounts of information about possible customers available to them; furthermore, they are increasingly able to push offers to them rather than having to passively wait for a consumer ...
Thus, the OPTIMAL-OFFER-SEQUENCE problem can be solved efficiently when the utility functions are symmetric. ...
doi:10.1007/978-3-642-35311-6_36
fatcat:gk6m5fgq2bcqtafc7doy2rrkoa
Optimal Pricing in the Presence of Local Network Effects
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In particular, we show that it is optimal for the monopolist to charge each agent a price that is proportional to her Bonacich centrality in the social network. ...
We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. ...
Finally, there is a recent stream of literature in computer science, that studies a set of algorithmic questions related to marketing strategies over social networks. ...
doi:10.1007/978-3-642-17572-5_10
fatcat:g34mhoc24bac7dlfkaez5ea4lq
A monopoly pricing model for diffusion maximization based on heterogeneous nodes and negative network externalities (Case study: A novel product)
2018
Decision Science Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
used to maximize diffusion in the network. ...
Social networks can provide sellers across the world with invaluable information about the structure of possible influences among different members of a network, whether positive or negative, and can be ...
Acknowledgement The authors would like to acknowledge helpful discussions and financial supports with Iranian E-Commerce Scientific Association. ...
doi:10.5267/j.dsl.2017.8.001
fatcat:jno6hak3sbg2ph7otgpxvvrwxu
Strategyproof Mechanisms for Content Delivery via Layered Multicast
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
In order to maximize either its revenue or the total utility of users, content providers employing layered multicast need to carefully choose a routing, layer allocation and pricing scheme. ...
We next tailor a payment scheme based on the idea of critical bids to derive a truthful mechanism that achieves a constant fraction of the optimal social welfare. ...
Theorem 4 Algorithm 3 computes revenue-maximizing prices with respect to the social welfare computed by A. ...
doi:10.1007/978-3-642-20798-3_7
fatcat:2cz24klhlvcbfjrjfczwzsqram
Pricing in social networks
2013
Games and Economic Behavior
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We analyze the problem of optimal monopoly pricing in social networks in order to characterize the influence of the network topology on the pricing rule. ...
JEL Classification Numbers: D85, D43, C69 We dedicate this paper to the memory of Toni Calvó-Armengol, a gifted network theorist and a wonderful friend. We thank Coralio Ballester, ...
Each monopoly chooses its price p i to maximize its own profit, taking as given the price p j chosen at all other nodes in the social network. ...
doi:10.1016/j.geb.2013.03.006
fatcat:pgvx6ku4fjcazfccldfiknhk2e
Optimal Pricing in Networks with Externalities
[article]
2011
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In particular, we show that it is optimal for the monopolist to charge each agent a price that is proportional to her Bonacich centrality in the social network. ...
We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. ...
Finally, there is a recent stream of literature in computer science, that studies a set of algorithmic questions related to marketing strategies over social networks. ...
arXiv:1101.5617v1
fatcat:lsu6djbfjzebxe4ve4uexy5uti
Optimal Pricing in Networks with Externalities
2012
Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
In particular, we show that it is optimal for the monopolist to charge each agent a price that is proportional to her Bonacich centrality in the social network. ...
We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. ...
Finally, there is a recent stream of literature in computer science, that studies a set of algorithmic questions related to marketing strategies over social networks. ...
doi:10.1287/opre.1120.1066
fatcat:ma76v2ir2fbr5bzissuncz7uh4
Trading networks with price-setting agents
2007
Proceedings of the 8th ACM conference on Electronic commerce - EC '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Our work differs from recent studies of how price is affected by network structure through our modeling of price-setting as a strategic activity carried out by a subset of agents in the system, rather ...
Finally, we consider how the profits obtained by the traders depend on the underlying graph -roughly, a trader can command a positive profit if and only if it has an "essential" connection in the network ...
First, we show how to maximize the total profit of a set of traders. The profit of trader t in an equilibrium is P i qti. ...
doi:10.1145/1250910.1250933
dblp:conf/sigecom/BlumeEKT07
fatcat:ucgpa7w44nbq5ptn436x7pl5jy
HEMS: a home energy market simulator
2014
Computer Science - Research and Development
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
A price signal can be exploited to reflect the availability of energy. ...
Artificial neural network controllers for energy prosumers can be designed to minimize individual and overall running costs. ...
Decision policies are considered efficient when they maximize social welfare, which is the sum of utilities delivered to traders in a certain outcome. ...
doi:10.1007/s00450-014-0291-7
fatcat:djv3yjoehbe2fl7hosmaxjaibi
Optimal price-based control of heterogeneous thermostatically controlled loads under uncertainty using LSTM networks and genetic algorithms
2019
F1000Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We use this prediction model in a genetic algorithm to find the best prices in terms of profit maximization in an energy arbitrage operation. ...
The simulation results show that the proposed method offers a profit equal to 96% of the theoretical optimal solution. ...
The LSTM network offered a high performance by extracting relevant features of the hidden state using its internal memory cell, allowing it to process sequences of sparse observations to learn the hidden ...
doi:10.12688/f1000research.20421.1
fatcat:q67xsko5xrc3hfqiczqgwne2gi
Trading networks with price-setting agents
2009
Games and Economic Behavior
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Our work differs from recent studies of how price is affected by network structure through our modeling of price-setting as a strategic activity carried out by a subset of agents in the system, rather ...
Finally, we consider how the profits obtained by the traders depend on the underlying graph -roughly, a trader can command a positive profit if and only if it has an "essential" connection in the network ...
First, we show how to maximize the total profit of a set of traders. The profit of trader t in an equilibrium is P i qti. ...
doi:10.1016/j.geb.2008.12.002
fatcat:loxoc4ntlncnzhqflgjo3njps4
Dynamic pricing strategies for social networks in the presence of externalities
2012
2012 Information Theory and Applications Workshop
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We propose a dynamic pricing strategy for maximizing the revenue of a seller who wishes to sell a divisible service (good) to buyers (agents) embedded in a social network. ...
Further, the computational complexity of each new round is cubic in the size of the social network. ...
In this work, we study optimal dynamic pricing strategies for a seller who wishes to sell a divisible service/goods to a set of buyers (agents) embedded in a social network. ...
doi:10.1109/ita.2012.6181773
dblp:conf/ita/SwapnaES12
fatcat:heki3rydtzbsfhogyi3n7mt4ze
Review of Computational Intelligence Methods for Local Energy Markets at the Power Distribution Level to Facilitate the Integration of Distributed Energy Resources: State-of-the-art and Future Research
2020
Energies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The aim of local energy markets is to optimize the objectives of market participants, e.g., to minimize the network operation cost for the distribution network operator, to maximize the profit of the private ...
The massive integration of distributed energy resources in power distribution systems in combination with the active network management that is implemented thanks to innovative information and communication ...
The objective of the agent is to find the optimal policy (optimal sequence of actions) that maximizes its expected reward. ...
doi:10.3390/en13010186
fatcat:3672qx4kqzht3lp4kizgq2kpo4
The catallaxy approach for decentralized economic-based allocation in Grid resource and service markets
2006
Applied intelligence (Boston)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
These resources can consist of computing power, storage of data or content, network bandwidth and sensor or actuators. ...
Catallactic agents discover selling nodes in the resource and service Grid markets, and negotiate with each other maximizing their utility by following a strategy. ...
Since service-copy agents negotiate in both markets, its strategy must aim at maximizing profit in both markets simultaneously. 3) Resource (R): An agent, the owner of a resource. ...
doi:10.1007/s10489-006-9650-9
fatcat:3w7eud6m6ra3rag6r5key3l5wi
Agent-Based Reallocation Problem on Social Networks
2013
Group Decision and Negotiation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A solution does not only consist in an optimal allocation, but in a sequence of transactions changing an initial allocation into an optimal solution. ...
Our method provides a sequence of transactions leading to an optimal allocation, with any restriction on agents' communication abilities. Provided solutions can be viewed as emergent phenomena. ...
We show that it is important to consider the social graph in order to guarantee the negotiation efficiency in real conditions. ...
doi:10.1007/s10726-012-9336-0
fatcat:gjggi6hnmzfbbj4erm772lauty
« Previous
Showing results 1 — 15 out of 17,233 results