We consider settings in which voters vote in sequence, each voter knows the votes of the earlier voters and the preferences of the later voters, and voters are strategic. This can be modeled as an extensive-form game of perfect information, which we call a Stackelberg voting game. We first propose a dynamic-programming algorithm for finding the backward-induction outcome for any Stackelberg vot...

It is now widely accepted that in many situations where classifiers are deployed, adversaries deliberately manipulate data in order to reduce the classifier’s accuracy. The most prominent example is email spam, where spammers routinely modify emails to get past classifier-based spam filters. In this paper we begin by modeling the interaction between the adversary and the data miner as a finite ...

This paper focuses on the single-issue negotiation between Manufacture Agent (MA) and Material Supplier Agent (MSA) of the supply chain. MSA resorts to find partners to cooperate when it cannot finish the order independently. A two stage negotiation protocol is proposed. The cooperative game is combined with MA-Stackelberg game to resolve the negotiation problem. It is used to establish the coa...

This paper investigates inventory management in a multi channel distribution system consisting of one manufacturer and an arbitrary number of retailers that face stochastic demand. Existence of the pure Nash equilibrium is proved and parameter restriction which implies uniqueness of it is derived. Also the Stackelberg game where the manufacturer plays a roll as a leader is discussed. Under spec...

This work deals with subsidy transfer from a manufacturer to a retailer through the distributor in cooperative advertising. While the retailer engages in local advertising, the manufacturer indirectly participates in retail advertising using advertising subsidy which is given to the distributor, who in turn transfers it to the retailer. The manufacturer is the Stackelberg game leader; the distr...

How should agents shape a finite “reputational" history to their advantage knowing that others will be learning from that history? We focus on one leader interacting with multiple followers and show that in most non-zero-sum games, the traditional Stackelberg mixed commitment is very fragile to observational uncertainty. We propose robust commitment rules that anticipate being learned and show ...

  Response time is one of the critical web service quality dimensions. It refers to how long it takes that a web service responds to request of a user. In order to manage the response time, pricing schemes can work as an efficient access control mechanism. In this paper, we study competition between two providers offering functionally same web services where there is a monopoly service provider...

This paper studies a three-level large scale linear programming problem, in which the objective functions at every level are to be maximized. Three-level programming problem can be thought as a static version of the Stackelberg strategy, which is used leader-follower game in which a Stackelberg strategy is used by the leader. This paper proposes a fuzzy approach for solving a three-planner mode...