\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Reverse Auction in Pricing Model},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2012-05-15 (revised: 15 May 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-05-15}
\title{Reverse Auction in Pricing Model}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Praveen  kulkarni}

             \author[2]{  Nagabhushan.S.V}

             \author[3]{  Dr.G.N.Srinivasan}

             \affil[1]{  VTU}

\renewcommand\Authands{ and }

\date{\small \em Received: 13 April 2012 Accepted: 5 May 2012 Published: 15 May 2012}

\maketitle


\begin{abstract}
        


Dynamic price discrimination adjusts prices based on the option value of future sales, which varies with time and units available. This paper surveys the theoretical literature on dynamic price discrimination, and confronts the theories with new data from airline pricing behavior, Consider a multiple booking class airline-seat inventory control problem that relates to either a single flight leg or to multiple flight legs. During the time before the flight, the airline may face the problems of (1) what are the suitable prices for the opened booking classes, and (2) when to close those opened booking classes. This work deals with these two problems by only using the pricing policy. In this paper, a dynamic pricing model is developed in which the demand for tickets is modeled as a discrete time stochastic process. An important result of this work is that the strategy for the ticket booking policy can be reduced to sets of critical decision periods, which eliminates the need for large amounts of data storage.

\end{abstract}


\keywords{Bidding, dynamic pricing, electronic markets, group-buying discounts, Internet based selling, market microstructure, online retailing, pricing mechani}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{INTRODUCTION}]{INTRODUCTION}\par
n Dynamic pricing mechanisms where buyers and sellers actively engage in the price discovery process. Today, traditional dynamic pricing mechanisms serve as the core business models for many Internet-based electronic markets. Indicative of its attractiveness to consumers in the Internet marketplace, the registered users of eBay increased from 1.2 million to 2.1 million during the last three months and about \$750 Million worth transactions were conducted on their website that year. Other new approaches like online trading and online auctions are also attracting consumers, however. They include dynamic Pricing mechanisms such as the name-your-own-price.E-bay is the world"s largest auction site where the buyers and seller are to be participating in the auction mechanism-bay is one of the most profitable e-business site, in one day 5,00,000 items may added in the auction site, this strategy can work throughout at the end of the day. The initial model of c2c auctions entirely managed by the technology, buyers can easily buy the products at any time in the auction site. Some sites use dynamic pricing in auction mechanism and they are like priceline.com this site involve the dynamic variations of the prices in the market. The other site which is known as travelbids.com in which the buyers can bid their money for travelling expenses through auction mechanism.\par
There are some websites like Priceline.com, TravelBids.com and BuyersEdge.com which uses dynamic pricing mechanism. Retailer itself, As this group-buying discount pricing mechanism is still a new phenomenon on the Internet, there have been no studies that have examined the performance of this market microstructure, and the nature of the bidder behaviour that can be observed as the market operates.\par
Research on consumer behaviour under the groupbuying market structure can help both academic researchers and industrial practitioners better understand this new kind of market intermediary, and the efficacy of the market mechanism that it provides to market participants. 
\section[{a) Basics of Auction Mechanism}]{a) Basics of Auction Mechanism}\par
The commonly used basic auction mechanisms can be classified into the following two main categories based on the number of bidding sides: a single auction and a double Auction , In a single auction, participants can take part only in one side of an auction (i.e., be either an auctioneer or a bidder). In a double auction, participants are free to take part in both side of an auction. Other kinds of auction mechanism are as follows.\par
Single auction mechanism: This type of auction can be divided into an open-outcry auction and a sealed bid auction based on bidding methods. In an openoutcry auction, the bids are open to public and Bidders can adjust their bids in the full knowledge of other bids. In a sealed bid auction, only a bidder and the auctioneer can communicate with each other, and bidder to bidder Communication is forbidden. The basic single auction sub-types with open-cry bid are English and Dutch auctions: English auction: In an English auction, an auctioneer creates an auction market and proceeds to solicit in open successively higher bids from the bidders until no one raises the bid. The highest bidder is the winner and pays the price he/she bid. Dutch auction: An auctioneer announces the bids to all bidders. The auctioneer starts the bidding at an extremely high price and then progressively lowers it until a buyer claims an item by calling "mine", or by pressing a button that stops an automatic clock. The winner pays the price bid at the stop time.\par
Double auction mechanism: A double auction admits multiple buyers and multiple sellers concurrently into the market. Thus, the double auction must match bids of the both sides in the market.  
\section[{b) Extended Types of Auction Mechanism}]{b) Extended Types of Auction Mechanism}\par
Multi-attribute Auction (MA): A Multi-attribute Auction allows bidders to bid on various attributes beyond the price. In this type of an auction, the auctioneer selects winners based on the price as well as on those various attributes. Thus, the overall utility of a deal for the buyer must consider not only the price of the auctioning item, but also a combination of the different attributes, Combinatorial Auction (CA):In a Combinatorial Auction, each bidder offers a bid for a collection of resources (of the bidder's choosing) rather than placing a bid on each item separately. This enables the bidder to express dependencies and complementarities between various resources. The auctioneer selects such set of these combinatorial bids that result in the highest revenue without assigning any item to more than one bidder. Snadholm showed that the number of possible allocations in a combinatorial auction is where m is the number of items traded in the auction.\par
Generalized Vickrey Auction (GVA): Another mechanism for determining prices for an allocation of multiple units of resources is the Generalized Vickrey Auction. In GVA, the price of a bidder k in the efficient allocation is computed by deducting the sum of payments of all other bidders in an allocation from the sum of the payments that would be obtained from those bidders in the optimum allocation where the bidder k removed from the allocation.\par
Finally, enough bidders must be willing to participate in future auction roundsto prevent a collapse of market prices. Because of these requirements, previously designedauctions cannot work efficiently in eservice markets.A static time differential pricing mechanism in which two or more tiers ofon/off peak rates are used can improve efficiency by partially matching lower (higher) demand with lower (higher) price. However, this mechanismstill remains inflexible, since demands of buyers do not follow a step function, but rather gradually shift from on-to off-peaks and back. Dynamic pricing mechanism that adapts tochanging market conditions constantly is more efficient. It maintains highresource utilization and the seller"s revenue in variety of market conditions. 
\section[{II.}]{II.} 
\section[{LITERATURE REVIEW}]{LITERATURE REVIEW}\par
In the year 2009, the paper proposed by Roumen Vragov, Di Shang, Karl R. Lang, In the paper "Auction based E-Procurement Mechanism Design ", They sugest that a view of an emerging phenomenon The E-procurement \hyperref[b2]{[3]}. But the drawback of a new mechanism is designed based on E-auction mechanism; one problem occurred during this paper that without internet we are not able to implement the auction strategies.\par
In the year 2009,the paper proposed by Hila Etzion and Scott Moore ,In the paper "Secure keyword auction: \hyperref[b3]{[4]} preserving privacy of bidding prices and CTRs",they suggest that we use a simulation model to extend previous analytical research on a firm selling consumer goods online using posted price and auction at the same time.Three research streams are useful in informing our how their expectations about future prices develop, and how their attitudes toward risk affect their behavior.but the drawback in this paper \hyperref[b15]{[16]} is Bidder and buyer reactions to prices are especially worthwhile to consider in the context of group buying discount electronic markets. Even though Drakopoulos doesn"t use the term explicitly, \hyperref[b13]{[14]} he explains the main idea of price indifference thresholds, which refer to the minimum price changes required for consumers to detect the differences. By incorporating a threshold into a demand curve, he proposes that when a price change is smaller than some critical threshold, consumers will not detect the price change, resulting in no change in demand. In our research, we will refer to the related term, price threshold, to indicate proximity in order quantity terms to the quantity-price combination that reflects a drop in price to the lower-tier \hyperref[b1]{[2]}.\par
In the year 2009,the paper proposed by Robert J. Kauffman, in the paper "New Buyers" Arrival under Dynamic Pricing Market Microstructure" they suggest that Using data collected from MobShop.com, the current study tested a model that predicts bidder participation and order arrivals in an electronic market that uses an innovative group-buying discount market microstructure. \hyperref[b3]{[4]}[5]The problem can be occurring as some buyer"s donot use the electronic equipments in the market. The variations of a cost can be high, the consumer can pay high amount for new features and new items can be added.\par
In the year 2009, the paper proposed by Shamik Sengupta and Mainak Chatterjee, in the paper "An Economic Framework for Dynamic Spectrum Access and Service Pricing" they suggest that Dynamic spectrum allocation coupled with fine granularity switching of services by end-users will engender a flexible and competitive environment for trading wireless services. \hyperref[b5]{[6]}[8] The drawback of this paper to implement the radio signals and their dynamic mechanism.In the year 2010,the paper proposed by Wei-Yu Lin, Guan-Yu Lin, Hung-Yu Wei, In the paper "Dynamic Auction Mechanism for resource allocation" they suggest The main contribution of this paper is developing a new resource allocation algorithm by applying auction method into the resource allocation, but one problem occurred while in the allocation of resources in the market, it is not able to determine the approximate profit Global Journal of Computer Science and Technology Volume XII Issue VII Version I and loss for a product in market.In the year 2011, the paper \hyperref[b8]{[9]} proposed by lin gao, xinbing wang and youyunxu, in the paper "Multiauctioneer Progressive Auction for Dynamic Spectrum Access", they suggest the problem of residual channel allocation We propose an auction-based mechanism MAP, in which each PO systematically raises the trading prices and each SU subsequently decides whether to buy a spectrum band and from which PO he is going to buy a spectrum band.\par
In the year 2011, the paper proposed by Andrew Chang, in the paper \hyperref[b7]{[8]} "Time dynamics of user behavior in a series of overlapping electronic mechanism" they suggest shed new lights on time dynamics of online user behavior in the market which comprise a series of multiple overlapping auctions, the error can be occur during the series of electronic equipments there might be a loss of data and loss of important database.\par
In the year 2011, the paper proposed by R. J. Thomas, T. D. Mount, R. Zimmerman, W. D. Schulze, in the paper \hyperref[b10]{[11]} "Testing the Effects of Price Responsive Demand on Uniform Price and Soft-Cap Electricity Auctions", they suggest that the effectiveness of a price while bidding in a market, the price can be low or high during auction mechanism. The drawback of this paper is the user can know about variations of prices in a market. But one problem occurs during researching of this paper that the user not able to extra features or more items.\par
In the year 2011, the paper proposed by Shabnam Sodagari, Alireza Attar, in the paper "On a Truthful Mechanism for Expiring Spectrum Sharing in Cognitive Radio Networks" they suggest a powerful tool to realize such subletting of Spectrum is auction mechanisms. In this paper, we proposed a dynamic, online auction for secondary spectrum access, the drawback of this paper is proposed auction structure, secondary CRs not only will submit their valuation of auctioned spectrum band, but also their arrival and departure time instances.\par
Computerized reservation systems were developed in the 1950s to keep track of airline seat booking and fare information. Initially these were internal systems, but were soon made available to travel agents. Deregulation of airline pricing in 1978 permitted much more extensive use of the systems for economic activity \hyperref[b11]{[12]}, especially pricing. The initial development of dynamically adjusted pricing is often credited to American Airlines" Robert Crandall, as a response to the rise of discount airline People"s express in the early 1980s. 
\section[{a) Problem Formulation}]{a) Problem Formulation}\par
The complexity and opaqueness of airline pricing has grown over time. As a result, the "yield management" \hyperref[b11]{[12]}systems employed by airlines for pricing have become one of the most arcane and complex information systems on the planet, and one with a very large economic component. Airline pricing represents a great challenge for modern economic analysis because it is so distant from the "law of one price" level of analysis. This surveys the theoretical literature, which is mostly found in operations research journals, develops some new theory, assesses the holes in our knowledge, and describes some results from a new database of airline prices. Dynamic pricing, which is also known as yield management or revenue management, is a set of pricing strategies aimed at increasing profits. The techniques are most useful when two product characteristics co-exist. First, the product expires at a point in time, like hotel rooms, airline flights, generated electricity, or time-dated ("sell before") products. Second, capacity is fixed well in advance and can be augmented only at a relatively high marginal cost. These characteristics create the potential for very large swings in the opportunity cost of sale, because the opportunity cost of sale is a potential foregone subsequent sale. The value of a unit in a shortage situation is the highest value of an unserved customer. Forecasting this value given current sales and available capacity represents dynamic pricing. 
\section[{III.}]{III.} 
\section[{EMPIRICAL SOLUTION}]{EMPIRICAL SOLUTION}\par
The dynamic pricing in auction mechanism involve some existing sytems like e-bay auction technology site and multi-agent wireless system for dynamic and local combined pricing, allocation and billing. The e-bay is an world"s largest auction site where this site shows the interaction between the seller and buyer-bay is one of the profitable e-business site, on ebay people can buy and sell just about anything, the company collects a submission see upfront and a commission as a percentage of the sale amount.\par
Example1: The auction process in e-bay: The seller fills in the appropriate registration information post the description of the item for sale specifying a minimum opening bid, if a successful bid is made ,the seller and the buyer negotiate the payment method, shipping details, warranty and other perticulers,e-bay is the interface through which sellers and buyers can conduct business. In 2011 e-bay started to auction fine art in collaboration with icollector.com of the united kingdom and sothebys.com, e-bay operates globally buyers from more than 150 other countries participate, trading can be made from anywhere and at any time.\par
Example 2 : Multi-Agent Wireless System for Dynamic and Local Combined Pricing, Allocation and Billing: In established communications systems with an underlying provider infrastructure the market is designed according to the Fixed Price Model (FPM). A user can get access to the network only if there are free resources controlled by the Base Station (BS) within a cell. Furthermore, he has to accept the fixed price for awide area and quasi-static in time. The user has to pay the same price whether there is a high or a low demanding the cell. Thus, if his preferences and purchase power allow him to spend more money for using Radio Resource Goods (RRG), he is not able to influence the allocation. For the same reason the operator misses the chance to increase his monetary gain by adapting the price for RRG to the users RRG evaluation.\par
To overcome these problems will introduce a distributed, dynamical and combined pricing, allocation and billing system, suitable for wireless infrastructure communications systems which are capable to manage multi-homing. By applying Cognitive Radio (CR) abilities not only to the allocation but also to this combined architecture, it is mandatory to dynamically allocate RRG by an Auction Sequence (AS) to exploit the CR abilities the repetition of auctions should happen very fast up to milliseconds to react on the load dynamic. A class of auctions, the multi-unit sealed-bid auction, is suitable to execute the auction within specified time and with an acceptable signalling effort in comparison to sequential auctions.The economical field auction theory mainly deals with single shot auction, but not with auction repetition. The framework of the optimal multi-unit auction is proposed in, but does not deal with repetitions and does not include learning facilities of the UTs. Gaining experience of the past and applying it in the current auction destroy the independence of the single shot auctions.the asymmetric balance of negotiation power needs to be considered in auction design. The prices bid in a basic auction are dependent only on the bidder"s willingness to pay. This means that intentions of only bidders, but not the auctioneer, are reflected in the auction winning prices. To restore the symmetric balance of negotiating power, the reservation price (RPA) and cancelable (CA) auctions were proposed. In RPA, only bids higher than the auctioneer"s reservation price are considered during winner selection. On the other hand, in CA, if the resulting revenue of an auction round does not meet the minimum requirement of the auctioneer, the entire auction round is cancelled. By providing reservation price or cancellation option to the auctioneer, the asymmetric negotiation power problem is resolved. However, when the perishable resources are traded, both of these auctions cause resource waste. In RPA, the reservation price restricts the number of winners. Hence, the resources unused because of this restriction are wasted. In CA, the cancellation of an auction round wastes the entire stock of resources that are allocated to this auction round.\par
IV. CONCLUSION 1. It is very clear that advances in internet and e-commerce technologies have opened up rich opportunities for reaping the benefits of dynamic pricing. Companies resorting to dynamic pricing strategies are increasing in number steadily. Moreover, increasingly complex dynamic pricing strategies are being tried out. In this paper, we have covered the following topics.\par
We have shown that the fixed pricing paradigm is giving way to a dynamic pricing paradigm in ebusiness markets and those dynamic pricing strategies: Conditions under which dynamic pricing strategies will outperform fixed pricing strategies have been enunciated.\par
Searching for more efficient ways of deciding the auctioneer"s optimal bid that defines the DW and PW classes. Seeking a better way to find the optimal winning score coefficient for the winner selection strategy. Attempting to identify more efficient and simpler pricing rules that preserve incentive compatibility but achieve higher auctioneer"s revenue Software modelling of dynamic pricing mechanism which illustrates the reliability and efficiency of the proposed model. 
\section[{ACKNOWLEDGEMENT}]{ACKNOWLEDGEMENT}\par
We thank all the authors for the information support V. 
\section[{FUTURE WORKS}]{FUTURE WORKS}\par
We can develop a pricing model for substitutable flights where customers choose among the available flights. To overcome computational problems posed by the formulation"s multi-dimensional state and action spaces, we considered heuristics based on pooling ideas. We also derived easilycomputable separable bounds for the value function of our model. Policies motivated by these bounds were shown numerically to be near optimal for a range of problem instances, and to dominate the policies from pooling in most cases. Our results suggest that pooling heuristics perform well for symmetric problems in which (a) customers, when viewed as a population, are mostly indifferent in their preferences over flights and (b) the flights have the same seating capacity. However, the pooling heuristics can perform poorly for asymmetric problems. The approaches motivated by the separable bounds do not suffer from such shortcomings, and remain implementable for large problems.\begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
can be divided into two main classes based on the\\
auction clearing time: Call Market and Continuous\\
Double Auction (CDA). In a Call Market, bids are\\
Praveen kulkarni collected over a specific time interval from both sellers ? , Nagabhushan.S.V ? , Dr.K.N. Subramanya ? \& Dr.G.N.Srinivasan ? and buyers in a sealed manner.\\
April\\
Author ? : Professor : Dept of IEM, RV College of Engineering.\\
E-mail : sansa96@gmail.com\\
Author : Department of Information Science,RVCE. ?\\
E-mail : srinivasangn@rvce.edu.in\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Zhou et al. (2008)]{b14}\label{b14} 	 		‘eBay in the Sky: Strategy-Proof Wireless Spectrum Auctions’.  		 			X Zhou 		,  		 			S Gandhi 		,  		 			S Suri 		,  		 			H Zheng 		.  	 	 		\textit{Proc. ACM MobiCom},  				 (ACM MobiCom)  		Sept. 2008.  	 
\bibitem[Wang et al. (2009)]{b13}\label{b13} 	 		‘Enabling public verifiability and data dynamics for storage security in cloud computing’.  		 			Q Wang 		,  		 			C Wang 		,  		 			J Li 		,  		 			K Ren 		,  		 			W Lou 		.  	 	 		\textit{Proc. of ESORICS"09},  				 (of ESORICS"09Saint Malo, France)  		Sep. 2009.  	 
\bibitem[Lin and Lin]{b1}\label{b1} 	 		\textit{Hung-Yu Wei and the prepared paper title was" Dynamic Auction Mechanism for Resource Allocation},  		 			Wei-Yu Lin 		,  		 			Guan-Yu Lin 		.  		p. 2010.  	 
\bibitem[Robert]{b4}\label{b4} 	 		\textit{Kauffman and bin wang and the prepared paper title was "New Buyers" Arrival under Dynamic Pricing Market Microstructure},  		 			J Robert 		.  		p. 2010.  	 
\bibitem[Vragov and Shang ()]{b5}\label{b5} 	 		\textit{Lang and the prepared paper title was "Should Online Auctions Employ Dynamic Buyout Pricing Models},  		 			Roumen Vragov 		,  		 			Di Shang 		,  		 			KarlR 		.  		2009.  	 
\bibitem[Vragov and Shang ()]{b2}\label{b2} 	 		\textit{Lang and the prepared paper title was" Auction based E-Procurement Mechanism Design},  		 			Roumen Vragov 		,  		 			Di Shang 		,  		 			KarlR 		.  		2009.  	 
\bibitem[Keegan (2009)]{b11}\label{b11} 	 		\textit{Online Auctions: From Seedy Flea Markets to Big Business},  		 			P Keegan 		.  		Jul 2009. U.S. edition. 11 p. .  	 
\bibitem[Tesauro and Kephart ()]{b17}\label{b17} 	 		‘Pricing in agent economies using neural networks and multiagent qlearning’.  		 			G Tesauro 		,  		 			J O Kephart 		.  	 	 		\textit{Proc. Workshop ABS-3: Learning about, from and with other agents (held in conjunction with IJCAI "99)},  				 (Workshop ABS-3: Learning about, from and with other agents (held in conjunction with IJCAI "99)Stockholm)  		2009.  	 
\bibitem[Szymanski and Lee (2010)]{b18}\label{b18} 	 		‘Return On Investment Constraints on Bidding and Revenue of Sponsored Search Auction’.  		 			B K Szymanski 		,  		 			J S Lee 		.  	 	 		\textit{Submitted to INFORMS Journal on Computing}  		July 2010.  	 
\bibitem[Secure keyword auction: preserving privacy of bidding prices and CTRs ()]{b3}\label{b3} 	 		\textit{Secure keyword auction: preserving privacy of bidding prices and CTRs},  		2009.  	 	 (Hila Etzion and Scott Moore and the prepared paper title was) 
\bibitem[Seokjoo Andrew Chang and the prepared paper title was "time dynamic pricing for user behavior ()]{b7}\label{b7} 	 		\textit{Seokjoo Andrew Chang and the prepared paper title was "time dynamic pricing for user behavior},  		in 2010.  	 
\bibitem[Simon Boardy Andrzej Skrzypacz on "Revenue Management with Forward-Looking Buyers "submitted on (2010)]{b19}\label{b19} 	 		\textit{Simon Boardy Andrzej Skrzypacz on "Revenue Management with Forward-Looking Buyers "submitted on},  				nov 2010.  	 
\bibitem[Simulation of Online Selling with Postedprice and Auctions: Comparison of Dual Channel"s Performance under Different Auction Mechanisms ()]{b6}\label{b6} 	 		\textit{Simulation of Online Selling with Postedprice and Auctions: Comparison of Dual Channel"s Performance under Different Auction Mechanisms},  		2008.  	 	 (Hila Etzion and Scott Moore and the prepared paper title was) 
\bibitem[Li et al. ()]{b12}\label{b12} 	 		‘Spectrum Bidding in Wireless Networks and Related’.  		 			X.-Y Li 		,  		 			P Xu 		,  		 			S Tang 		,  		 			X Chu 		.  	 	 		\textit{Proc. Conf. Computing and Combinatorics (COCOON "08)},  				 (Conf. Computing and Combinatorics (COCOON "08))  		2008.  	 
\bibitem[Chang et al. (2010)]{b10}\label{b10} 	 		‘The Effects of Trading Methods on Volatility and Liquidity: Evidence From the Taiwan Stock Exchange’.  		 			R P Chang 		,  		 			S T Hsu 		,  		 			N Huang 		,  		 			S G Rhee 		.  	 	 		\textit{Journal of Business Finance and Accounting}  		Jan/Mar 2010.  	 
\bibitem[Bakos (2008)]{b9}\label{b9} 	 		‘The Emerging Role of Electronic Marketplaces on the Internet’.  		 			Y Bakos 		.  	 	 		\textit{Communications of the ACM}  		Aug 2008.  	 
\bibitem[Andrews (2009)]{b8}\label{b8} 	 		‘The New Laws of Dynamic Pricing’.  		 			W Andrews 		.  	 	 		\textit{Internet World}  		Dec 15, 2009.  	 
\bibitem[Zhou and Zheng ()]{b15}\label{b15} 	 		‘TRUST: A General Framework for Truthful Double Spectrum Auctions’.  		 			X Zhou 		,  		 			H Zheng 		.  	 	 		\textit{Proc. IEEE INFOCOM},  				 (IEEE INFOCOM)  		2009.  	 
\bibitem[Lian et al. (2009)]{b16}\label{b16} 	 		‘Virtual Surrounding Face Recasting with Guaranteed Message Delivery for Ad Hoc and Sensor Networks’.  		 			J Lian 		,  		 			Y Liu 		,  		 			K Naik 		,  		 			L Chen 		.  	 	 		\textit{IEEE/ACM Trans. Networking}  		Feb. 2009. 17  (1)  p. .  	 
\bibitem[Lin and Wang ()]{b0}\label{b0} 	 		\textit{Youyun Xu and the prepared paper title was "Multi-auctioneer Progressive Auction for Dynamic Spectrum Access},  		 			Gao Lin 		,  		 			Xinbing Wang 		.  		2011.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
