International Conference on Information and Computation Economies最新文献

{"title":"Market-driven service allocation in a QoS-capable environment","authors":"S. Lalis, Christos Nikalaou, D. Papadakis, M. Marazakis","doi":"10.1145/288994.289017","DOIUrl":"https://doi.org/10.1145/288994.289017","url":null,"abstract":"1. ABSTIL4CT In this paper we describe a prototype that supports end-to-end QoS for applications invoking services over an ATM switch. The required resource bundles are allocated to applications via auctions taking place in two independent markets. We report results of initial experiments with alternative configurations that have been performed to investigate the effects of market independence in the behavior of the system. 1.1","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125443624","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Price dynamics of vertically differentiated information markets","authors":"J. Sairamesh, J. Kephart","doi":"10.1145/288994.289000","DOIUrl":"https://doi.org/10.1145/288994.289000","url":null,"abstract":"We e@ore the price dynamicsof a verticallyMkmntiated marketin which two or more sellers compete to providean informationgood orserviceto a populationof lmyers.Each sellerofh-s the good or serviceat a iixed levd of “quality”, and attempts to set its price in sud a way that it mtities its om profit. Five dii%rentsellerpricingstrategies, rangingwidelyfrom onesthat requireperfectknowledgeand unlimitedcomputationalpowerto onesthat requireverylittle lmowledgeor computationalcapability,are employedin two d.ifkmntbuyer populations, and the resulting collective dynamics are studied using a comb-mationof analysis and simulation. In a population of quality-sensitivebuyers, all pricing strategieslead to a ptice eqpilibriutnpredictedby a game-theoreticanalysis. However,in a population of price-sensitivebuyers,most pricingstrategieslead to large-amplitudecyclicalprice wars. The circumstancesunderwhichcyclicalpricewarsoccurcanbe explainedin terms of the topology of an underlying’>rofit landscape” [1].","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"390 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115206904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"MarketNet: market-based protection of information systems","authors":"Y. Yemini, A. Dailianas, D. Florissi, Gur Huberman","doi":"10.1145/288994.289032","DOIUrl":"https://doi.org/10.1145/288994.289032","url":null,"abstract":"This paper describes novel market-based technologies for systematic, quantifiable and predictable protection of information systems against attacks. These technologies, incorporated in the MarketNet system, use currency to control access to information systems resources and to account for their use. Clients wishing to access a resource must pay in currency acceptable to the domain that owns the resource. An attacker must thus pay to access the resources used in an attack. Therefore, the opportunities to attack and the damage that can be caused are strictly limited by the budget available to the attacker. A domain can control its exposure to attacks by setting the prices of critical resources and by limiting the currency that it makes available to potential attackers. Currency carries unique identifiers, enabling a domain to pinpoint the sources of attacks. Currency also provides a resource-independent instrumentation to monitor and correlate access patterns and to detect intrusion attacks through automated, uniform statistical analysis of anomalous currency flows. These mechanisms are resource-independent, and admit unlimited scalability for very large systems consisting of federated domains operated by mutually distrustful administrations. They uniquely establish quantifiable and adjustable limits on the power of attackers; enable verifiable accountability for malicious attacks; and admit systematic, uniform monitoring and detection of attacks.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123544388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Quality of service provision in noncooperative networks: heterogenous preferences, multi-dimensional QoS vectors, and burstiness","authors":"Kihong Park, Meera Sitharam, Shaogang Chen","doi":"10.1145/288994.289022","DOIUrl":"https://doi.org/10.1145/288994.289022","url":null,"abstract":"This paper studies the quality of service (QoS) provision problem in noncooperative networks where applications or users are selfish and routers implement generalized processor sharing (GPS)-based packet scheduling. First, we formulate a model of QoS provision in nonc~ operative networks where users are given the freedom to choose both the service classes and traffic volume allocated, and heterogeneousQoS preferences are captured by individual utility functions. We present a comprehensive analysis of the noncooperative multi-class QoS provision game, giving a complete characterization of Nash equilibria and their existence criteria, and show under what conditions they are Pareto and system optimal We show that, in general, Nash equilibria need not exist, and when they do exist, they need not be Pareto nor system optimalHowever, we show that for certain “resource-plentiful” systems, the world indeed can be nice with Nash equilibria, Pareto optima, and system optima collapsing into a single class. Second, we study the problem of fac-ditating efiective QoS in systems with multi-dimensional QoS vectors containing ●Supporteclinpart by NSF grants.4NI-9714707, ESS-9806741, and grants from PRF and Sprint. tSupported in part by NSF grant CCR-9409809Present address: Dept. of Computer and InformationScienceand Engineering,Universityof Florida, Gainesville,FL 32611 $Supported in part by NSF grant -4NI-9714iOiPennission10makedigitalorhardcopiesof allorpartof thisworkfor personal orclassroomuseisgrantedwithoutfm pro~idedthatcopies arenotmadeordistriiuledforprotitorcomrnemial adwomgeandthat copiesbearthisnoticeandthefullcitationonthefirstpage.To copy otherwise, torepublish, topostonsen,ersortoredism-bute tolists, requires priorspecificpermissionand~or a fea ICE 9S CharlestonSC LISA Copyright ACM 19981-581 13-076-7/98/10...S5.00 Chen$ both meanand burstiness-related QoS measures. We extend the game-theoretic analysis to multi-dimensional QoS vector games and show under what conditions the aforementioned results carry over. Motivated by the same context, we study the impact of burstiness under multiple QoS measures on the properties of the induced QoS levels rendered by the service classes in the system. We show that under bursty traffic conditions, it is, in general, impossible for a service class to deliver quality of service superior in both meanand burstiness-related QoS measures.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123547049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Adaptive agents in a persistent shout double auction","authors":"C. Preist, M. V. Tol","doi":"10.1145/288994.288998","DOIUrl":"https://doi.org/10.1145/288994.288998","url":null,"abstract":"agents, double auction, electronic trading, negotiation, adaptive behaviour Cliff (1997) has demonstrated that simple, adaptive agents are able to trade in a form of double auction marketplace, in such a way that trade prices converge towards the equilibrium price of the marketplace. However, the marketplace within which the agents trade is unrealistic. In this paper, we consider a more realistic form of double auction market, the persistent shout double auction. We present agents based on the ZIP agents of Cliff (1997), but with an alternative set of heuristics for use within this auction. We demonstrate that the resulting agents achieve equilibrium significantly faster than ZIP agents do, maintain a more stable equilibrium, and are more robust to changes in learning rate.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121510658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"How can routers help Internet economics?","authors":"John Schnizlein","doi":"10.1145/288994.289005","DOIUrl":"https://doi.org/10.1145/288994.289005","url":null,"abstract":"1. ABSTRACT Statistical sharing enables remarkable network efficiency in internets, compared to circuit-switched networks, but complicates economic efficiency associating traffic priority with users’ valuations. How can the network (routers) differentiate service so that it justifies differential pricing? One approach is integrating internets with reservations which can be billed, like calls, based on duration and capacity. A more recent approach is differential treatment of packets marked for different types of service. Peak traffic rates over a negotiated time period can be either measured or controlled. These peak rates aggregate, with some degree of asynchrony, to the capacity limit of the network. At this limit, routers protect the network from congestive collapse by dropping additional traffic based on the type of service marks. Although modern TCP end stations respond by reducing their network loads to a fair share, nonresponsive applications threaten the integrity of the Internet. Can billing for congestion effectively control this threat? 1.1","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122568170","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A computational economy for dynamic load balancing and data replication","authors":"A. Anastasiadi, S. Kapidakis, C. Nikolauo, J. Sairamesh","doi":"10.1145/288994.289031","DOIUrl":"https://doi.org/10.1145/288994.289031","url":null,"abstract":"We consider a computational economy with many suppliers who offer processing and database access services to consumers for a fee Consumers submit a variety of database transactions to the suppliers for processing, and they select suppliers based on the quality of service (QoS), data-access price offered by the suppliers and network bandwidth cost. The suppliers in an attempt to maximize profit control the following (I) prices to access the data objects; (2) prices to lease data-objects that are in demandIn this paper, we use such an economic framework to investigate controllable load-balanang and object replication algorithms for performance driven transaction process%g. We show via de tailed worliload driven simulation that this computational economy adapts to changes in transaction -workloads and types, and d.yna.rnicallybalances load and replicates data Pem~ission to makedigitalorhardcopiesof allorpartof thisworkfor pemmalorclassroomuseis-mted withoutfeeprovidedthatcopies arenotmadeordistriiukdforprotitorcommercial advantage andthat copiesbearthisnoticeandthefill citationonIhefirstpage.To copy otherwisetorepublish. topostonsen,ersortoredism%ute to lists, requirespriorspecificpermissionand~or a fm. ICE 9S CharlestonSC USA Copyright AChl 19981-5S113-076-7/98/10...S5.00 objects based on the consumer demand.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121096430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Experiments in designing computational economies for mobile users","authors":"Tracy Mullen, J. Breese","doi":"10.1145/288994.288999","DOIUrl":"https://doi.org/10.1145/288994.288999","url":null,"abstract":"Abstract Distributed operating systems provide users with transparent access to network-wide resources. As changes occur to network resources, or as user locations and preferences evolve, the system must be able to adapt by reallocating, replicating, or moving its resources. We explore a market-based approach to resource allocation in such environments, and describe initial experiments in designing and building computational markets for distributed operating system resources. We focus on the problem of redistributing network file allocations for a mobile user population in order to improve locality and accessibility.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115306635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Proceedings 15th Interaction and Concurrency Experience, ICE 2022, Lucca, Italy, 17th June 2022","authors":"","doi":"10.48550/arXiv.2208.04086","DOIUrl":"https://doi.org/10.48550/arXiv.2208.04086","url":null,"abstract":"","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134124282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Proceedings Fourth Interaction and Concurrency Experience, ICE 2011, Reykjavik, Iceland, 9th June 2011","authors":"Andrei Dorman, T. Heindel","doi":"10.4204/EPTCS.59.4","DOIUrl":"https://doi.org/10.4204/EPTCS.59.4","url":null,"abstract":"Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics. While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general. Hence, the goal of this article is to obtain a compositional semantics for graph transformation system in analogy to the structural operational semantics (SOS) for Milner's Calculus of Communicating Systems (CCS). \u0000The paper introduces an SOS style axiomatization of the standard labelled transition semantics for graph transformation systems. The first result is its equivalence with the so-called Borrowed Context technique. Unfortunately, the axiomatization is not compositional in the expected manner as no rule captures \"internal\" communication of sub-systems. The main result states that such a rule is derivable if the given graph transformation system enjoys a certain property, which we call \"complementarity of actions\". Archetypal examples of such systems are interaction nets. We also discuss problems that arise if \"complementarity of actions\" is violated.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114295696","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}