Generative model of bid sequences in lowest unique bid auctions

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Lowest unique bid auction (LUBA) sites are gaining popularity on the Internet in recent years. In this paper, we study LUBA with resubmission in discrete bid spaces. A long-standing goal in the field of Internet auction is to develop agents that can perceive and understand the strategy information behind the mechanism and can guide us to behave in a fast, frugal and smart way. We marry ideas from recurrent neural network and data to learn a generative model for generating winning bid sequences. A sequence of winning bids in Internet auctions can be viewed as a sequence of events and modeled by generative models. We learn a model that is able to capture the long dependencies in a winning bid sequence. The generated data obtained from our model and the ground truth dataset share similar distributions.

Original languageEnglish (US)
Title of host publicationProceedings of the 30th Chinese Control and Decision Conference, CCDC 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3179-3184
Number of pages6
ISBN (Electronic)9781538612439
DOIs
StatePublished - Jul 6 2018
Event30th Chinese Control and Decision Conference, CCDC 2018 - Shenyang, China
Duration: Jun 9 2018Jun 11 2018

Other

Other30th Chinese Control and Decision Conference, CCDC 2018
CountryChina
CityShenyang
Period6/9/186/11/18

Fingerprint

Generative Models
Auctions
Lowest
Internet
Recurrent neural networks
Recurrent Neural Networks
Bid
Model

Keywords

  • auction
  • game theory
  • generative model
  • LUBA
  • recurrent neural network

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Control and Optimization
  • Decision Sciences (miscellaneous)

Cite this

Xu, Y., & Hamidou, T. (2018). Generative model of bid sequences in lowest unique bid auctions. In Proceedings of the 30th Chinese Control and Decision Conference, CCDC 2018 (pp. 3179-3184). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CCDC.2018.8407671

Generative model of bid sequences in lowest unique bid auctions. / Xu, Yida; Hamidou, Tembine.

Proceedings of the 30th Chinese Control and Decision Conference, CCDC 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 3179-3184.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xu, Y & Hamidou, T 2018, Generative model of bid sequences in lowest unique bid auctions. in Proceedings of the 30th Chinese Control and Decision Conference, CCDC 2018. Institute of Electrical and Electronics Engineers Inc., pp. 3179-3184, 30th Chinese Control and Decision Conference, CCDC 2018, Shenyang, China, 6/9/18. https://doi.org/10.1109/CCDC.2018.8407671
Xu Y, Hamidou T. Generative model of bid sequences in lowest unique bid auctions. In Proceedings of the 30th Chinese Control and Decision Conference, CCDC 2018. Institute of Electrical and Electronics Engineers Inc. 2018. p. 3179-3184 https://doi.org/10.1109/CCDC.2018.8407671
Xu, Yida ; Hamidou, Tembine. / Generative model of bid sequences in lowest unique bid auctions. Proceedings of the 30th Chinese Control and Decision Conference, CCDC 2018. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 3179-3184
@inproceedings{a53c0b07c2dc4f5b9f1a7e4502a525a8,
title = "Generative model of bid sequences in lowest unique bid auctions",
abstract = "Lowest unique bid auction (LUBA) sites are gaining popularity on the Internet in recent years. In this paper, we study LUBA with resubmission in discrete bid spaces. A long-standing goal in the field of Internet auction is to develop agents that can perceive and understand the strategy information behind the mechanism and can guide us to behave in a fast, frugal and smart way. We marry ideas from recurrent neural network and data to learn a generative model for generating winning bid sequences. A sequence of winning bids in Internet auctions can be viewed as a sequence of events and modeled by generative models. We learn a model that is able to capture the long dependencies in a winning bid sequence. The generated data obtained from our model and the ground truth dataset share similar distributions.",
keywords = "auction, game theory, generative model, LUBA, recurrent neural network",
author = "Yida Xu and Tembine Hamidou",
year = "2018",
month = "7",
day = "6",
doi = "10.1109/CCDC.2018.8407671",
language = "English (US)",
pages = "3179--3184",
booktitle = "Proceedings of the 30th Chinese Control and Decision Conference, CCDC 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Generative model of bid sequences in lowest unique bid auctions

AU - Xu, Yida

AU - Hamidou, Tembine

PY - 2018/7/6

Y1 - 2018/7/6

N2 - Lowest unique bid auction (LUBA) sites are gaining popularity on the Internet in recent years. In this paper, we study LUBA with resubmission in discrete bid spaces. A long-standing goal in the field of Internet auction is to develop agents that can perceive and understand the strategy information behind the mechanism and can guide us to behave in a fast, frugal and smart way. We marry ideas from recurrent neural network and data to learn a generative model for generating winning bid sequences. A sequence of winning bids in Internet auctions can be viewed as a sequence of events and modeled by generative models. We learn a model that is able to capture the long dependencies in a winning bid sequence. The generated data obtained from our model and the ground truth dataset share similar distributions.

AB - Lowest unique bid auction (LUBA) sites are gaining popularity on the Internet in recent years. In this paper, we study LUBA with resubmission in discrete bid spaces. A long-standing goal in the field of Internet auction is to develop agents that can perceive and understand the strategy information behind the mechanism and can guide us to behave in a fast, frugal and smart way. We marry ideas from recurrent neural network and data to learn a generative model for generating winning bid sequences. A sequence of winning bids in Internet auctions can be viewed as a sequence of events and modeled by generative models. We learn a model that is able to capture the long dependencies in a winning bid sequence. The generated data obtained from our model and the ground truth dataset share similar distributions.

KW - auction

KW - game theory

KW - generative model

KW - LUBA

KW - recurrent neural network

UR - http://www.scopus.com/inward/record.url?scp=85050849833&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85050849833&partnerID=8YFLogxK

U2 - 10.1109/CCDC.2018.8407671

DO - 10.1109/CCDC.2018.8407671

M3 - Conference contribution

AN - SCOPUS:85050849833

SP - 3179

EP - 3184

BT - Proceedings of the 30th Chinese Control and Decision Conference, CCDC 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -