Diodato Catalano Ferraioli Authors: Add personal information
 Affiliation history
Bibliometrics: publication history
 Average citations per article 2.50 Citation Count 55 Publication count 22 Publication years 2006-2017 Available for download 9 Average downloads per article 62.00 Downloads (cumulative) 558 Downloads (12 Months) 169 Downloads (6 Weeks) 19
SEARCH
ROLE
Author only

AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas

BOOKMARK & SHARE

 #resultstats2 { width:100%; padding: 10px; background-color:#ECE9D8; /*background:#9c9;*/ } #resultstats { width:100%; /*background-color:#ECE9D8;*/ font-size: 12px; /*background:#9c9;*/ } #resultstats a:link { text-decoration: none; } #resultstats div { padding-bottom: 5px; padding-top: 5px; } #resfound { background-color: #ece9d8; padding-left:5px } #searchtools { display:inline; float:right; padding-right: 10px; } #refinements { padding-top: 5px; } #refinements table { margin-left: 10px; } #refinements tr { vertical-align:top; } #refinements span { font-size: 12px; } .rectots { font-size:12px; } .problem { font-size:12px; color: red; } div.problem { height: 400px; } #results { /* float:right; */ /* width:80%; */ color: #000000; font-family: Verdana,Arial,Helvetica,sans-serif; font-size: 12px; padding-top: 10px; /*background:#9c9;*/ } #aggs { float:left; width:20%; font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; } #pagelogic { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #pagerange { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:left; padding-bottom: 10px; } #resultmenu { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #resultmenu label { margin-right: 0px; vertical-align:bottom; } #resultmenu input { margin-right: 0px; vertical-align:bottom; } #resultmenu select { margin-right: 0px; background-color: #aff; border: 0; border-radius: 0; font-size: 12px; } #resultmenu option { font-size: 12px; background-color: white; } .aggHead { font-weight: bold; padding-bottom: 0; padding-top: 10px; } #aggs ul{ list-style-type: none; margin-top: 0.25em; padding-left: 0; font-size: 1em; } #upcevents li{ padding-bottom: 1.25em; } #upcevents div{ margin-top: 25px; } a.showhide:link { text-decoration: none; } #results .numbering{ font-size: 12px; font-weight:bold; width:30px; float:left; text-align: right; padding-top: 2px; } #results .details{ font-size: 12px; width:92%; float:right; padding-bottom: 20px; } #results .title{ font-size: 14px; padding-bottom:5px; } #results .authors{ font-size: 12px; padding-bottom:5px; } #results .source{ font-size: 12px; padding-bottom:5px; } #results .publisher{ font-size: 12px; padding-bottom:5px; } #results .metrics{ font-size: 12px; padding-bottom:5px; } #results .metricsCol1{ float: left; display:inline; padding-bottom:5px; } #results .metricsCol2{ float: right; display: inline; width: 590px; padding-bottom:5px; } #results .ft{ font-size: 12px; padding-bottom:5px; } #results .abstract{ font-size: 12px; padding-bottom:5px; } #results .kw{ font-size: 12px; padding-bottom:5px; } #results .pubother{ font-size: 12px; padding-bottom:5px; } .izers { margin-top: 10px; margin-bottom:10px; } .highlights em{ background-color: #FFFF00; font-style: normal; } .publicationDate { background-color: #aff; } .citedCount { } .download6Weeks { } .download12Months { } .downloadAll { } 22 results found Export Results: bibtex | endnote | acmref | csv Result 1 – 20 of 22 Result page: 1 2 Sort by: relevance publication date citation count downloads (6 Weeks) downloads (12 months) downloads (overall) 1 December 2017 ACM Transactions on Economics and Computation (TEAC) - Special Issue on Wine'15: Volume 5 Issue 4, December 2017 Publisher: ACM Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 6,   Downloads (12 Months): 6,   Downloads (Overall): 6 Full text available: PDF We study the revenue performance of sequential posted-price mechanisms and some natural extensions for a setting where the valuations of the buyers are drawn from a correlated distribution. Sequential posted-price mechanisms are conceptually simple mechanisms that work by proposing a “take-it-or-leave-it” offer to each buyer. We apply sequential posted-price mechanisms ... Keywords: Mechanism design, posted pricing, approximation, correlated values, interdependence 2 August 2017 IJCAI'17: Proceedings of the 26th International Joint Conference on Artificial Intelligence Publisher: AAAI Press Bibliometrics: Citation Count: 0 Motivated by privacy and security concerns in online social networks, we study the role of social pressure in opinion games. These are games, important in economics and sociology, that model the formation of opinions in a social network. We enrich the definition of (noisy) best-response dynamics for opinion games by ... 3 May 2017 AAMAS '17: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems Publisher: International Foundation for Autonomous Agents and Multiagent Systems Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 6,   Downloads (12 Months): 60,   Downloads (Overall): 60 Full text available: PDF The emergence of online social networks has revolutionized the way people seek and share information. Nowadays, popular online social sites as Twitter, Facebook and Google+ are among the major news sources as well as the most effective channels for viral marketing. However, these networks also became the most effective channel ... Keywords: independent cascade model, social network, maximum spanning arborescence, source identification, spread of misinformation, unbalanced cut 4 May 2017 AAMAS '17: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems Publisher: International Foundation for Autonomous Agents and Multiagent Systems Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Downloads (Overall): 14 Full text available: PDF In a discrete preference game, each agent is equipped with an internal belief and declares her preference from a discrete set of alternatives. The payoff of an agent depends on whether the declared preference agrees with the belief of the agent and on the coordination with the preferences declared by ... Keywords: opinion formation, social network, best-response dynamics, price of anarchy 5 October 2016 Theoretical Computer Science: Volume 648 Issue C, October 2016 Publisher: Elsevier Science Publishers Ltd. Bibliometrics: Citation Count: 0 Game theory studies situations in which strategic players can modify the state of a given system, in the absence of a central authority. Solution concepts, such as Nash equilibrium, have been defined in order to predict the outcome of such situations. In multi-player settings, it has been pointed out that ... Keywords: Algorithmic game theory, Logit dynamics, Convergence rate to equilibria 6 September 2016 Algorithmica: Volume 76 Issue 1, September 2016 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 2 We present the first general bounds on the mixing time of the Markov chain associated to the logit dynamics for wide classes of strategic games. The logit dynamics with inverse noise $$\beta$$β describes the behavior of a complex system whose individual components act selfishly according to some partial ("noisy") ... Keywords: Game theory, Convergence time, Markov Chain, Potential games 7 July 2016 IJCAI'16: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence Publisher: AAAI Press Bibliometrics: Citation Count: 2 Recently, much attention has been devoted to discrete preference games to model the formation of opinions in social networks. More specifically, these games model the agents' strategic decision of expressing publicly an opinion, which is a result of an interplay between the agent's private belief and the social pressure. However, ... 8 May 2016 AAMAS '16: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems Publisher: International Foundation for Autonomous Agents and Multiagent Systems Bibliometrics: Citation Count: 1 Downloads (6 Weeks): 5,   Downloads (12 Months): 32,   Downloads (Overall): 32 Full text available: PDF We aim at identifying a minimal set of conditions under which algorithms with good approximation guarantees are truthful without money. In line with recent literature, we wish to express such a set via verification assumptions, i.e., kind of agents' misbehavior that can be made impossible by the designer. We initiate ... Keywords: facility location, mechanisms with verification, mechanisms without money 9 December 2015 WINE 2015: Proceedings of the 11th International Conference on Web and Internet Economics - Volume 9470 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 3 It is often observed that agents tend to imitate the behavior of their neighbors in a social network. This imitating behavior might lead to the strategic decision of adopting a public behavior that differs from what the agent believes is the right one and this can subvert the behavior of ... 10 December 2015 WINE 2015: Proceedings of the 11th International Conference on Web and Internet Economics - Volume 9470 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 2 We study the revenue performance of sequential posted price mechanisms and some natural extensions, for a general setting where the valuations of the buyers are drawn from a correlated distribution. Sequential posted price mechanisms are conceptually simple mechanisms that work by proposing a "take-it-or-leave-it" offer to each buyer. We apply ... 11 November 2015 Algorithmica: Volume 73 Issue 3, November 2015 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 0 Logit choice dynamics constitute a family of randomized best response dynamics based on the logit choice function (McFadden in Frontiers in econometrics. Academic Press, New York, 1974) that models players with limited rationality and knowledge. In this paper we study the all-logit dynamics [also known as simultaneous learning (Alós-Ferrer and ... Keywords: Logit dynamics, Concurrent updates, Game dynamics, Reversibility, Markov chain, Noisy dynamics 12 October 2015 Theory of Computing Systems: Volume 57 Issue 3, October 2015 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 0 Best-response Mechanisms, introduced by Nisan et al. (2011) provide a unifying framework for studying various distributed protocols in which the participants are instructed to repeatedly best respond to each others' strategies. Two fundamental features of these mechanisms are convergence and incentive compatibility. This work investigates convergence and incentive compatibility conditions ... Keywords: Noise, Convergence, Game dynamics, Incentive compatibility, Best-response 13 May 2015 AAMAS '15: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems Publisher: International Foundation for Autonomous Agents and Multiagent Systems Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 1,   Downloads (12 Months): 23,   Downloads (Overall): 101 Full text available: PDF In the last 10 years, a vast amount of scientific literature has studied the problem of influence maximization. Yet, only very recently have scientists started considering the more realistic case in which competing entities try to expand their market and maximize their share via viral marketing. Goyal and Kearns [STOC ... Keywords: threshold model, voter model, influence diffusion, logit dynamics, submodularity, social networks 14 January 2015 AAAI'15: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence Publisher: AAAI Press Bibliometrics: Citation Count: 0 In this paper, we study protocols that allow to discern conscious and unconscious decisions of human beings; i.e., protocols that measure awareness. Consciousness is a central research theme in Neuroscience and AI, which remains, to date, an obscure phenomenon of human brains. Our starting point is a recent experiment, called ... 15 May 2014 AAMAS '14: Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems Publisher: International Foundation for Autonomous Agents and Multiagent Systems Bibliometrics: Citation Count: 2 Downloads (6 Weeks): 7,   Downloads (12 Months): 17,   Downloads (Overall): 28 Full text available: PDF An active stream of research is devoted to the design of polynomial approximation algorithms for the fair allocation of indivisible goods. Central to this field is the MaxMin Allocation problem, for which there is a significant gap between known approximation and inapproximability results. Closing this gap is a stimulating challenge. ... Keywords: approximation, computational social choice, fairness 16 June 2013 ACM SIGecom Exchanges: Volume 12 Issue 1, June 2013 Publisher: ACM Bibliometrics: Citation Count: 1 Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Downloads (Overall): 38 Full text available: PDF We describe logit dynamics, which are used to model bounded rationality in games, and their related equilibrium concept, the logit equilibrium. We also present some results about the convergence time of these dynamics and introduce a suitable approximation of the logit equilibrium. We conclude by describing some interesting future extensions ... Keywords: bounded rationality, equilibrium concept, game dynamics 17 October 2012 SAGT 2012: Proceedings of the 5th International Symposium on Algorithmic Game Theory - Volume 7615 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 0 Game theory studies situations in which strategic players can modify the state of a given system, due to the absence of a central authority. Solution concepts, such as Nash equilibrium, are defined to predict the outcome of such situations. In the spirit of the field, we study the computation of ... 18 October 2012 SAGT'12: Proceedings of the 5th international conference on Algorithmic Game Theory Publisher: Springer-Verlag Bibliometrics: Citation Count: 5 Game theory studies situations in which strategic players can modify the state of a given system, due to the absence of a central authority. Solution concepts, such as Nash equilibrium, are defined to predict the outcome of such situations. In the spirit of the field, we study the computation of ... 19 January 2012 SODA '12: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms Publisher: Society for Industrial and Applied Mathematics Bibliometrics: Citation Count: 8 Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Downloads (Overall): 122 Full text available: PDF Logit Dynamics [Blume, Games and Economic Behavior, 1993] is a randomized best response dynamics for strategic games: at every time step a player is selected uniformly at random and she chooses a new strategy according to a probability distribution biased toward strategies promising higher payoffs. This process defines an ergodic ... 20 June 2011 SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures Publisher: ACM Bibliometrics: Citation Count: 10 Downloads (6 Weeks): 3,   Downloads (12 Months): 20,   Downloads (Overall): 119 Full text available: PDF We present the first general bounds on the mixing time of logit dynamics for wide classes of strategic games. The logit dynamics describes the behaviour of a complex system whose individual components act "selfishly" and keep responding according to some partial ("noisy") knowledge of the system. In particular, we prove ... Keywords: game theory, Markov chains, mixing time

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us