Applied Filters
- Shaddin Dughmi
- AuthorRemove filter
People
Colleagues
- Shaddin Dughmi (43)
- Tim Avelin Roughgarden (9)
- Haifeng Xu (7)
- Robert David Kleinberg (6)
- Milind Shashikant Tambe (5)
- Moshe Babaioff (4)
- Shahar Dobzinski (4)
- David Matthias Kempe (3)
- Jason D. Hartline (3)
- Rad Niazadeh (3)
- Vincent Conitzer (3)
- Yu Cheng (3)
- Aaron Leon Roth (2)
- Albert Xin Jiang (2)
- Aleksandrs Slivkins (2)
- Nicole Immorlica (2)
- Peerapong Dhangwatnotai (2)
- Qiqi Yan (2)
- Yaron Singer (2)
- Zinovi Rabinovich (2)
Roles
Publication
Proceedings/Book Names
- EC '12: Proceedings of the 13th ACM Conference on Electronic Commerce (2)
- EC '16: Proceedings of the 2016 ACM Conference on Economics and Computation (2)
- EC '17: Proceedings of the 2017 ACM Conference on Economics and Computation (2)
- BQGT '10: Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions (1)
- CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge management (1)
- EC '09: Proceedings of the 10th ACM conference on Electronic commerce (1)
- EC '10: Proceedings of the 11th ACM conference on Electronic commerce (1)
- EC '11: Proceedings of the 12th ACM conference on Electronic commerce (1)
- EC '22: Proceedings of the 23rd ACM Conference on Economics and Computation (1)
- FOCS '08: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science (1)
- FOCS '09: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science (1)
- FOCS '10: Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (1)
- FOCS '11: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (1)
- SODA '10: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms (1)
- SODA '14: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms (1)
- STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computing (1)
- STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (1)
- STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (1)
- STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing (1)
- Web and Internet Economics (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleOpen AccessPublished By ACMPublished By ACM
Limitations of Stochastic Selection Problems with Pairwise Independent Priors
- Shaddin Dughmi
University of Southern California, Los Angeles, USA
, - Yusuf Hakan Kalayci
University of Southern California, Los Angeles, USA
, - Neel Patel
University of Southern California, Los Angeles, USA
STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing•June 2024, pp 479-490• https://doi.org/10.1145/3618260.3649718Motivated by the growing interest in correlation-robust stochastic optimization, we investigate stochastic selection problems beyond independence. Specifically, we consider the instructive case of pairwise-independent priors and matroid constraints. We ...
- 2Citation
- 129
- Downloads
MetricsTotal Citations2Total Downloads129Last 12 Months129Last 6 weeks30
- Shaddin Dughmi
- research-articleOpen AccessPublished By ACMPublished By ACM
Delegated Pandora's Box
- Curtis Bechtel
University of Southern California, Los Angeles, CA, USA
, - Shaddin Dughmi
University of Southern California, Los Angeles, CA, USA
, - Neel Patel
University of Southern California, Los Angeles, CA, USA
EC '22: Proceedings of the 23rd ACM Conference on Economics and Computation•July 2022, pp 666-693• https://doi.org/10.1145/3490486.3538267In delegation problems, a principal does not have the resources necessary to complete a particular task, so they delegate the task to an untrusted agent whose interests may differ from their own. Given any family of such problems and space of mechanisms ...
- 3Citation
- 260
- Downloads
MetricsTotal Citations3Total Downloads260Last 12 Months117Last 6 weeks16
- Curtis Bechtel
- research-articleOpen AccessPublished By ACMPublished By ACM
Bernoulli Factories and Black-box Reductions in Mechanism Design
- Shaddin Dughmi
Department of Computer Science, University of Southern California, Los Angeles, CA, USA
, - Jason Hartline
Computer Science Department, Northwestern University, IL, USA
, - Robert D. Kleinberg
Department of Computer Science, Cornell University, NY, USA
, - Rad Niazadeh
Chicago Booth School of Business, University of Chicago, Chicago, IL, USA
Journal of the ACM, Volume 68, Issue 2•April 2021, Article No.: 10, pp 1-30 • https://doi.org/10.1145/3440988We provide a polynomial time reduction from Bayesian incentive compatible mechanism design to Bayesian algorithm design for welfare maximization problems. Unlike prior results, our reduction achieves exact incentive compatibility for problems with multi-...
- 5Citation
- 545
- Downloads
MetricsTotal Citations5Total Downloads545Last 12 Months188Last 6 weeks45
- Shaddin Dughmi
- Article
Bayesian Repeated Zero-Sum Games with Persistent State, with Application to Security Games
- Vincent Conitzer
Duke University, Durham, USA
, - Yuan Deng
Duke University, Durham, USA
, - Shaddin Dughmi
University of Southern California, Los Angeles, USA
AbstractWe study infinitely-repeated two-player zero-sum games with one-sided private information and a persistent state. Here, only one of the two players learns the state of the repeated game. We consider two models: either the state is chosen by nature,...
- 0Citation
MetricsTotal Citations0
- Vincent Conitzer
- research-article
Algorithmic Bayesian Persuasion
SIAM Journal on Computing, Volume 50, Issue 3, pp STOC16-68-STOC16-97 • https://doi.org/10.1137/16M1098334Persuasion, defined as the act of exploiting an informational advantage in order to influence the decisions of others, is ubiquitous. Indeed, persuasive communication has been estimated to account for almost a third of all economic activity in the U.S. ...
- 3Citation
MetricsTotal Citations3
- research-articlePublic Access
Mitigating the Curse of Correlation in Security Games by Entropy Maximization
- Haifeng Xu
University of Southern California, Los Angeles, CA, USA
, - Shaddin Dughmi
University of Southern California, Los Angeles, CA, USA
, - Milind Tambe
University of Southern California, Los Angeles, CA, USA
, - Venil Loyd Noronha
University of Southern California, Los Angeles, CA, USA
AAMAS '18: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems•July 2018, pp 2127-2129In Stackelberg security games, a defender seeks to randomly allocate limited security resources to protect critical targets from an attack. In this paper, we study a fundamental, yet underexplored, phenomenon in security games, which we term the Curse ...
- 0Citation
- 128
- Downloads
MetricsTotal Citations0Total Downloads128Last 12 Months57Last 6 weeks16
- Haifeng Xu
- research-articlefree
On the distortion of voting with multiple representative candidates
- Yu Cheng
Duke University
, - Shaddin Dughmi
University of Southern California
, - David Kempe
University of Southern California
AAAI'18/IAAI'18/EAAI'18: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence•February 2018, Article No.: 119, pp 973-980We study positional voting rules when candidates and voters are embedded in a common metric space, and cardinal preferences are naturally given by distances in the metric space. In a positional voting rule, each candidate receives a score from each ...
- 0Citation
- 100
- Downloads
MetricsTotal Citations0Total Downloads100Last 12 Months75Last 6 weeks16
- Yu Cheng
- research-articlePublished By ACMPublished By ACM
Bernoulli factories and black-box reductions in mechanism design
- Shaddin Dughmi
University of Southern California
, - Jason D. Hartline
Northwestern University
, - Robert Kleinberg
Cornell University
, - Rad Niazadeh
Stanford University
ACM SIGecom Exchanges, Volume 16, Issue 1•August 2017, pp 58-71 • https://doi.org/10.1145/3144722.3144728In this letter, we report on our work providing a polynomial time reduction from Bayesian incentive compatible mechanism design to Bayesian algorithm design for welfare maximization problems. Unlike prior results, our reduction achieves exact incentive ...
- 2Citation
- 24
- Downloads
MetricsTotal Citations2Total Downloads24Last 12 Months2Last 6 weeks1
- Shaddin Dughmi
- research-articlePublic AccessPublished By ACMPublished By ACM
Of the People: Voting Is More Effective with Representative Candidates
- Yu Cheng
University of Southern California, Los Angeles, CA, USA
, - Shaddin Dughmi
University of Southern California, Los Angeles, CA, USA
, - David Kempe
University of Southern California, Los Angeles, CA, USA
EC '17: Proceedings of the 2017 ACM Conference on Economics and Computation•June 2017, pp 305-322• https://doi.org/10.1145/3033274.3085155In light of the classic impossibility results of Arrow and Gibbard and Satterthwaite regarding voting with ordinal rules, there has been recent interest in characterizing how well common voting rules approximate the social optimum. In order to quantify ...
- 11Citation
- 227
- Downloads
MetricsTotal Citations11Total Downloads227Last 12 Months52Last 6 weeks11- 1
Supplementary Material04b_04cheng.mp4
- Yu Cheng
- research-articlePublic AccessPublished By ACMPublished By ACM
Algorithmic Persuasion with No Externalities
- Shaddin Dughmi
University of Southern California, Los Angeles, CA, USA
, - Haifeng Xu
University of Southern California, Los Angeles, CA, USA
EC '17: Proceedings of the 2017 ACM Conference on Economics and Computation•June 2017, pp 351-368• https://doi.org/10.1145/3033274.3085152We study the algorithmics of information structure design --- a.k.a. persuasion or signaling --- in a fundamental special case introduced by Arieli and Babichenko: multiple agents, binary actions, and no inter-agent externalities. Unlike prior work on ...
- 20Citation
- 456
- Downloads
MetricsTotal Citations20Total Downloads456Last 12 Months87Last 6 weeks3- 1
Supplementary Material05b_03dughmi.mp4
- Shaddin Dughmi
- research-articlePublished By ACMPublished By ACM
Bernoulli factories and black-box reductions in mechanism design
- Shaddin Dughmi
University of Southern California, USA
, - Jason D. Hartline
Northwestern University, USA
, - Robert Kleinberg
Cornell University, USA
, - Rad Niazadeh
Cornell University, USA
STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing•June 2017, pp 158-169• https://doi.org/10.1145/3055399.3055492We provide a polynomial-time reduction from Bayesian incentive-compatible mechanism design to Bayesian algorithm design for welfare maximization problems. Unlike prior results, our reduction achieves exact incentive compatibility for problems with multi-...
- 23Citation
- 56
- Downloads
MetricsTotal Citations23Total Downloads56Last 12 Months3- 1
Supplementary Materiald3_sa_am_t1.mp4
- Shaddin Dughmi
- research-articlePublished By ACMPublished By ACM
Posting Prices with Unknown Distributions
- Moshe Babaioff
Microsoft Research, Herzliya Israel
, - Liad Blumrosen
The Hebrew University, Jerusalem, Israel
, - Shaddin Dughmi
University of Southern California, Los Angeles, CA
, - Yaron Singer
Harvard University, MA
ACM Transactions on Economics and Computation, Volume 5, Issue 2•May 2017, Article No.: 13, pp 1-20 • https://doi.org/10.1145/3037382We consider a dynamic auction model, where bidders sequentially arrive to the market. The values of the bidders for the item for sale are independently drawn from a distribution, but this distribution is unknown to the seller. The seller offers a ...
- 11Citation
- 281
- Downloads
MetricsTotal Citations11Total Downloads281Last 12 Months22Last 6 weeks3
- Moshe Babaioff
- research-articlePublished By ACMPublished By ACM
Algorithmic information structure design: a survey
- Shaddin Dughmi
University of Southern California
ACM SIGecom Exchanges, Volume 15, Issue 2•January 2017, pp 2-24 • https://doi.org/10.1145/3055589.3055591Information structure design, also sometimes known as signaling or persuasion, is concerned with understanding the effects of information on the outcomes of strategic interactions (the descriptive question), and in characterizing and computing the ...
- 43Citation
- 464
- Downloads
MetricsTotal Citations43Total Downloads464Last 12 Months58Last 6 weeks5
- Shaddin Dughmi
- research-articlePublic AccessPublished By ACMPublished By ACM
Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding
- Shaddin Dughmi
University of Southern California
, - Tim Roughgarden
Stanford University
, - Qiqi Yan
Google Research
Journal of the ACM, Volume 63, Issue 4•November 2016, Article No.: 30, pp 1-33 • https://doi.org/10.1145/2908735We design the first truthful-in-expectation, constant-factor approximation mechanisms for NP-hard cases of the welfare maximization problem in combinatorial auctions with nonidentical items and in combinatorial public projects. Our results apply to ...
- 10Citation
- 427
- Downloads
MetricsTotal Citations10Total Downloads427Last 12 Months46Last 6 weeks3
- Shaddin Dughmi
- research-articlePublic AccessPublished By ACMPublished By ACM
Persuasion with Limited Communication
- Shaddin Dughmi
University of Southern California, Los Angeles, CA, USA
, - David Kempe
University of Southern California, Los Angeles, CA, USA
, - Ruixin Qiang
University of Southern California, Los Angeles, CA, USA
EC '16: Proceedings of the 2016 ACM Conference on Economics and Computation•July 2016, pp 663-680• https://doi.org/10.1145/2940716.2940781We examine information structure design, also called "persuasion" or "signaling," in the presence of a constraint on the amount of communication. We focus on the fundamental setting of bilateral trade, which in its simplest form involves a seller with a ...
- 21Citation
- 777
- Downloads
MetricsTotal Citations21Total Downloads777Last 12 Months247Last 6 weeks39
- Shaddin Dughmi
- research-articlePublished By ACMPublished By ACM
Lottery Pricing Equilibria
- Shaddin Dughmi
University of Southern California, Los Angeles, USA
, - Alon Eden
Tel Aviv University, Tel Aviv, Israel
, - Michal Feldman
Tel Aviv University, Tel Aviv, Israel
, - Amos Fiat
Tel Aviv University, Tel Aviv, Israel
, - Stefano Leonardi
Sapienza University of Rome, Rome, Italy
EC '16: Proceedings of the 2016 ACM Conference on Economics and Computation•July 2016, pp 401-418• https://doi.org/10.1145/2940716.2940742We extend the notion of Combinatorial Walrasian Equilibrium, as defined by \citet{FGL13}, to settings with budgets. When agents have budgets, the maximum social welfare as traditionally defined is not a suitable benchmark since it is overly optimistic. ...
- 7Citation
- 206
- Downloads
MetricsTotal Citations7Total Downloads206Last 12 Months9Last 6 weeks1
- Shaddin Dughmi
- research-articlePublished By ACMPublished By ACM
Algorithmic Bayesian persuasion
- Shaddin Dughmi
University of Southern California, USA
, - Haifeng Xu
University of Southern California, USA
STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing•June 2016, pp 412-425• https://doi.org/10.1145/2897518.2897583Persuasion, defined as the act of exploiting an informational advantage in order to effect the decisions of others, is ubiquitous. Indeed, persuasive communication has been estimated to account for almost a third of all economic activity in the US. ...
- 36Citation
- 655
- Downloads
MetricsTotal Citations36Total Downloads655Last 12 Months150Last 6 weeks13
- Shaddin Dughmi
- research-article
Signaling in Bayesian Stackelberg Games
- Haifeng Xu
University of Southern California, Los Angeles, CA, USA
, - Rupert Freeman
Duke University, Durham, NC, USA
, - Vincent Conitzer
Duke University, Durham, NC, USA
, - Shaddin Dughmi
University of Southern California, Los Angeles, CA, USA
, - Milind Tambe
University of Southern California, Los Angeles, CA, USA
AAMAS '16: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems•May 2016, pp 150-158Algorithms for solving Stackelberg games are used in an ever-growing variety of real-world domains. Previous work has extended this framework to allow the leader to commit not only to a distribution over actions, but also to a scheme for stochastically ...
- 7Citation
- 186
- Downloads
MetricsTotal Citations7Total Downloads186Last 12 Months17
- Haifeng Xu
- research-articlePublished By ACMPublished By ACM
SIGecom job market candidate profiles 2016
ACM SIGecom Exchanges, Volume 14, Issue 1•June 2015, pp 2-40 • https://doi.org/10.1145/2845926.2845927In the sixteen years since the inception of EC as the flagship conference of the SIGecom community, we have learned a lot about the efficiency (or lack thereof) of markets. We have studied markets for school choice, marriage, supply chains, advertising, ...
- 0Citation
- 67
- Downloads
MetricsTotal Citations0Total Downloads67Last 12 Months8
- Article
Mixture Selection, Mechanism Design, and Signaling
FOCS '15: Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS)•October 2015, pp 1426-1445• https://doi.org/10.1109/FOCS.2015.91We pose and study a fundamental algorithmic problem which we term mixture selection, arising as a building block in a number of game-theoretic applications: Given a function g from the n-dimensional hypercube to the bounded interval [-1, 1], and an n × ...
- 13Citation
MetricsTotal Citations13
Author Profile Pages
- Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples: - History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
- Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.
Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
- Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
- Future Direction:
The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.
A direct search interface for Author Profiles will be built.
An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.
It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.
Bibliometrics
The ACM DL is a comprehensive repository of publications from the entire field of computing.
It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.
- Average citations per article = The total Citation Count divided by the total Publication Count.
- Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
- Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
- Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
- Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
- Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
- Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
- Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
- Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)
ACM Author-Izer Service
Summary Description
ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.
Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.
ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.
To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.
How ACM Author-Izer Works
Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.
The Service can be applied to all the articles you have ever published with ACM.
Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.
For authors who do not have a free ACM Web Account:
- Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.
For authors who have an ACM web account, but have not edited their ACM Author Profile page:
- Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.
For authors who have an account and have already edited their Profile Page:
- Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"
ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.
Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.
FAQ
- Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
- Q. What articles are eligible for ACM Author-Izer?
- A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.
- Q. Are there any restrictions on authors to use this service?
- A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.
- Q. What are the requirements to use this service?
- A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.
- Q. What is an ACM Author Profile Page?
- A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.
- Q. How do I find my Author Profile page and take ownership?
- A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours
- Q. Why does my photo not appear?
- A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters
- Q. What if I cannot find the Add Personal Information function on my author page?
- A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.
- Q. What happens if an author changes the location of his bibliography or moves to a new institution?
- A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.
- Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
- A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.
However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.
- Q. What happens if the author’s bibliography lives on a page with several aliases?
- A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.
- Q. Why should authors use ACM Author-Izer?
- A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.
- Q. Does ACM Author-Izer provide benefits for authors?
- A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.
Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.
- Q. How does ACM Author-Izer benefit the computing community?
- A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.
In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.
- Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
- A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.
- Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
- A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner