{"id":{"repo_id":"msu","oai_identifier":"oai:d.lib.msu.edu:etd_4163"},"canonical_url":"https://search.ndltd.org/etd/msu/oai:d.lib.msu.edu:etd_4163","repository":{"repo_id":"msu","name":"Michigan State University","base_url":"https://d.lib.msu.edu/oai"},"display":{"title":"Learning from turtles : an agent-based model of a generalized second-price auction","abstract":"\"A generalized second-price (GSP) auction is the standard way to allocate search advertising slots on a search results page. In order to acquire slots, advertisers submit bids for a search keyword. Each time a search user sends a search query, an auction begins. The search engine sorts the bids and concludes the auction with the slot allocation. Currently, advertisers do not have access to the bids submitted by their opponents. In this dissertation, I used agent-based modeling to simulate auctions under different information disclosure policies. I investigated three information disclosure policies: no information disclosure, partial information disclosure, and perfect information disclosure. Under the no information disclosure policy, a search engine does not disclose bid information. Under partial and perfect information disclosure policies, a search engine announces bid statistics and bids from the prior round respectively. The simulated auctions ran in different scenarios, which were formed by varying values of several parameters. My goal was to learn about the effects of bid information disclosure policies on search engine revenue and surplus generation from these simulations. Through the simulations and analyses, I illustrated that a search engine can generate higher levels of revenue under the partial information disclosure policy than under the other two information disclosure policies. I also found that GSP auctions were relatively robust in terms of surplus generation.\"--Page ii.","abstract_html":"&quot;A generalized second-price (GSP) auction is the standard way to allocate search advertising slots on a search results page. In order to acquire slots, advertisers submit bids for a search keyword. Each time a search user sends a search query, an auction begins. The search engine sorts the bids and concludes the auction with the slot allocation. Currently, advertisers do not have access to the bids submitted by their opponents. In this dissertation, I used agent-based modeling to simulate auctions under different information disclosure policies. I investigated three information disclosure policies: no information disclosure, partial information disclosure, and perfect information disclosure. Under the no information disclosure policy, a search engine does not disclose bid information. Under partial and perfect information disclosure policies, a search engine announces bid statistics and bids from the prior round respectively. The simulated auctions ran in different scenarios, which were formed by varying values of several parameters. My goal was to learn about the effects of bid information disclosure policies on search engine revenue and surplus generation from these simulations. Through the simulations and analyses, I illustrated that a search engine can generate higher levels of revenue under the partial information disclosure policy than under the other two information disclosure policies. I also found that GSP auctions were relatively robust in terms of surplus generation.&quot;--Page ii.","abstract_has_math":false,"creators":["Ma, Wenjuan"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Wildman, Steven S.","Bauer, Johannes M.","LaRose, Robert","Wash, Rick"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016","date_published":"2016","updated_at":"2026-11-18T18:46:32Z","subjects":["Web search engines","Keyword searching","Internet auctions","Internet advertising"],"languages":["English"],"rights":["In Copyright"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:4163","isbn:9781369439366","isbn:1369439369","oclc:993441319","umi:10251065","local:Ma_grad.msu_0128D_15068"],"render_values":[{"text":"etd:4163","href":null,"code":true},{"text":"isbn:9781369439366","href":null,"code":true},{"text":"isbn:1369439369","href":null,"code":true},{"text":"oclc:993441319","href":null,"code":true},{"text":"umi:10251065","href":null,"code":true},{"text":"local:Ma_grad.msu_0128D_15068","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/doi:10.25335/9pd9-bk21","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/doi:10.25335/9pd9-bk21","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://d.lib.msu.edu/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Ad.lib.msu.edu%3Aetd_4163","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Wildman, Steven S.","Bauer, Johannes M.","LaRose, Robert","Wash, Rick"]},{"key":"dc:creator","label":"Author","values":["Ma, Wenjuan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2016"]},{"key":"dc:relation","label":"Dc Relation","values":["Electronic Theses & Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["Text","Theses"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Web search engines","Keyword searching","Internet auctions","Internet advertising"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:4163","isbn:9781369439366","isbn:1369439369","oclc:993441319","umi:10251065","local:Ma_grad.msu_0128D_15068","https://doi.org/doi:10.25335/9pd9-bk21"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["\"A generalized second-price (GSP) auction is the standard way to allocate search advertising slots on a search results page. In order to acquire slots, advertisers submit bids for a search keyword. Each time a search user sends a search query, an auction begins. The search engine sorts the bids and concludes the auction with the slot allocation. Currently, advertisers do not have access to the bids submitted by their opponents. In this dissertation, I used agent-based modeling to simulate auctions under different information disclosure policies. I investigated three information disclosure policies: no information disclosure, partial information disclosure, and perfect information disclosure. Under the no information disclosure policy, a search engine does not disclose bid information. Under partial and perfect information disclosure policies, a search engine announces bid statistics and bids from the prior round respectively. The simulated auctions ran in different scenarios, which were formed by varying values of several parameters. My goal was to learn about the effects of bid information disclosure policies on search engine revenue and surplus generation from these simulations. Through the simulations and analyses, I illustrated that a search engine can generate higher levels of revenue under the partial information disclosure policy than under the other two information disclosure policies. I also found that GSP auctions were relatively robust in terms of surplus generation.\"--Page ii.","Thesis (Ph. D.)--Michigan State University. Information and Media, 2016","Includes bibliographical references (pages 110-115)"]},{"key":"dc:format","label":"Dc Format","values":["xii, 115 pages","application/pdf"]},{"key":"dc:title","label":"Title","values":["Learning from turtles : an agent-based model of a generalized second-price auction"]}]}],"canonical_facts":{"dc:contributor":["Wildman, Steven S.","Bauer, Johannes M.","LaRose, Robert","Wash, Rick"],"dc:creator":["Ma, Wenjuan"],"dc:date":["2016"],"dc:description":["\"A generalized second-price (GSP) auction is the standard way to allocate search advertising slots on a search results page. In order to acquire slots, advertisers submit bids for a search keyword. Each time a search user sends a search query, an auction begins. The search engine sorts the bids and concludes the auction with the slot allocation. Currently, advertisers do not have access to the bids submitted by their opponents. In this dissertation, I used agent-based modeling to simulate auctions under different information disclosure policies. I investigated three information disclosure policies: no information disclosure, partial information disclosure, and perfect information disclosure. Under the no information disclosure policy, a search engine does not disclose bid information. Under partial and perfect information disclosure policies, a search engine announces bid statistics and bids from the prior round respectively. The simulated auctions ran in different scenarios, which were formed by varying values of several parameters. My goal was to learn about the effects of bid information disclosure policies on search engine revenue and surplus generation from these simulations. Through the simulations and analyses, I illustrated that a search engine can generate higher levels of revenue under the partial information disclosure policy than under the other two information disclosure policies. I also found that GSP auctions were relatively robust in terms of surplus generation.\"--Page ii.","Thesis (Ph. D.)--Michigan State University. Information and Media, 2016","Includes bibliographical references (pages 110-115)"],"dc:format":["xii, 115 pages","application/pdf"],"dc:identifier":["etd:4163","isbn:9781369439366","isbn:1369439369","oclc:993441319","umi:10251065","local:Ma_grad.msu_0128D_15068","https://doi.org/doi:10.25335/9pd9-bk21"],"dc:language":["English"],"dc:relation":["Electronic Theses & Dissertations"],"dc:rights":["In Copyright"],"dc:subject":["Web search engines","Keyword searching","Internet auctions","Internet advertising"],"dc:title":["Learning from turtles : an agent-based model of a generalized second-price auction"],"dc:type":["Text","Theses"]},"updated_at":"2026-11-18T18:46:32Z"}