Two-player games on graphs are widely studied in formal methods as they model the interaction between a system and its environment. The game is played by moving a token throughout a graph to produce an infinite path. There are several common modes to determine how the players move the token through the graph; e.g., in turn-based games the players alternate turns in moving the token. We study th...

We examine the profitability of two-part tariffs in name-your-own-price (NYOP) markets using incentivecompatible laboratory experiments. An NYOP seller who uses a two-part tariff charges an upfront nonrefundable bidding fee akin to an entrance fee into his store. We find two-part tariffs can be profitable to NYOP sellers, and we identify a strong moderator of this profitability: a decision aid ...

This paper focuses on the coordination of a population of thermostatically controlled loads (TCLs) with unknown parameters to achieve group objectives. The problem involves designing the device bidding and market clearing strategies to motivate self-interested users to realize efficient energy allocation subject to a feeder capacity constraint. This coordination problem is formulated as a mecha...

How should players bid in keyword auctions such as those used by Google, Yahoo! and MSN? We model ad auctions as a dynamic game of incomplete information, so we can study the convergence and robustness properties of various strategies. In particular, we consider best-response bidding strategies for a repeated auction on a single keyword, where in each round, each player chooses some optimal bid...

Sponsored search involves running an auction among advertisers who bid in order to have their ad shown next to search results for specific keywords. The most popular auction for sponsored search is the “Generalized Second Price” (GSP) auction where advertisers are assigned to slots in the decreasing order of their score, which is defined as the product of their bid and click-through rate. One o...

In the deregulated electricity market bidding contest is the major operation. Prices obtained from the result of bidding strategy is essential, since all market participants do not be familiar with the accurate assessment of future prices in their decision-making process. Locational Marginal Pricing (LMP) obtains from the Optimal Power Flow problem gives the economic value of electrical energy ...

This paper is concerned with multistage bidding models introduced by De Meyer and Moussa Saley (2002) to analyze the evolution of the price system at finance markets with asymmetric information. The zero-sum repeated games with incomplete information are considered modeling the bidding with countable sets of possible prices and admissible bids. It is shown that, if the liquidation price of a sh...

This paper studies shill bidding in the VCG mechanism applied to combinatorial auctions. Shill bidding is a strategy whereby a single decision-maker enters the auction under the guise of multiple identities (Sakurai et al. 1999). I formulate the problem of optimal shill bidding for a bidder who knows the aggregate bid of her opponents. A key to the analysis is a subproblem–the cost minimization...

The simultaneous multiple-round auction (SMRA) and the combinatorial clock auction (CCA) are the two primarymechanisms used to sell bandwidth. Under truthful bidding, the SMRA is known to output a Walrasian equilibrium that maximizes social welfare provided the bidder valuation functions satisfy the gross substitutes property [20]. Recently, it was shown that the combinatorial clock auction (CC...

T paper analyzes sequential auctioning of single units of an indivisible good to a fluctuating population composed of overlapping generations of unit-demand bidders. Two phenomena emergent in such a market are investigated: forward-looking bidding strategies, and closed-loop selling strategies that involve learning from past prices. The buyers shade their bids down, i.e., bid less than they wou...