# Web | Homework代写 | Racket代做 | Ai | Assignment代写 – Game Theory, Social Choice, and Mechanism

Web | Homework代写 | Racket代做 | Ai | Assignment代写 – 这是一个利用racket进行的AI方面的编程代写任务

### homework Game Theory, Social Choice, and Mechanism

Please read the rules for assignments on the course web page (http://www.cs.duke.edu/courses/fall18/compsci590.2/). Use Piazza (preferred) or directly contact Harsh ([email protected]), Han- rui ([email protected]), or Vince ([email protected]) with any questions. Use Sak AI to turn in the assignment.

- (Properties of voting rules.) Alice likes to analyze the outcomes of elections; specifically, she is interested in the different outcomes that different voting rules produce on the same votes. To do so, she executes many different rules on the same set of votes, a painstak- ing process. She likes knowing about properties of voting rules that ease her task. For example, she likes to know which voting rules satisfy the Condorcet criterion, so that if there is a Condorcet winner, she immediately knows that that will be the winner for those rules, without having to go through the trouble of executing each rule individually. Recently, Alice has become interested in the phenomenon of votes cancelling out. Let us say that a set^1 Sof votescancels out with respect to voting rule rif foreverysetT of votes, the winner^2 thatrproduces forTis the same as the winner thatrproduces forST. For example, the set of votes{a bc, bac, cab}cancels out with respect to the plurality rule: each candidate is ranked first once in this set of votes, so it has no net effect on the outcome of the election. The same set does not cancel out with respect to Borda, though, because from these votes,agets 4 points,bgets 3, andcgets 2, which may affect the outcome of the election. Alice likes to know when a set of votes cancels out with respect to a rule, so that she can just ignore these votes, easing her computation of the winner. Define a pair ofopposite votesto be a pair of votes with completely opposite rankings of the candidates, i.e. the votes can be written asc 1 c 2 .. .cm andcm cm 1 .. .c 1. Let us say that a voting rulersatisfies the Opposites Cancel Out (OCO)criterion if every pair of opposite votes cancels out with respect tor.

(^1) Technically, a multiset, since the same vote may occur multiple times. (^2) … or set of winners if there are ties.

1a. (12 points)From among the (reasonable^3 ) voting rules discussed in class, give 3 voting rules that satisfy the OCO criterion, and 3 that do not (and say which ones are which!).

```
Define acycleof votes to be a set of votes that can be written asc 1 c 2
```

.. .cm, c 2 c 3 … cmc 1 , c 3 c 4 .. .cmc 1 c 2 ,… , cmc 1 c 2 .. .cm 1. Let us say that a voting rulersatisfies theCycles Cancel Out (CCO)criterion if every cycle cancels out with respect tor.

1b. (12 points)From among the (reasonable) voting rules discussed in class, give 3 voting rules that satisfy the CCO criterion, and 3 that do not.

Define a pair ofopposite cyclesof votes to be a cycle, plus all the opposite votes of votes in that cycle. Note that these opposite votes themselves constitute a cycle, the opposite of which is the original cycle. Let us say that a voting rule rsatisfies theOpposite Cycles Cancel Out (OCCO)criterion if every pair of opposite cycles cancels out with respect tor.

1c. (12 points)From among the (reasonable) voting rules discussed in class, give 5 voting rules that satisfy the OCCO criterion, and 1 that does not.

1d. (14 points)CriterionC 1 isstrongerthan criterionC 2 if every rule that satisfiesC 1 also satisfiesC 2. Two criteria areincomparableif neither is stronger than the other. For every pair of criteria among OCO, CCO, and OCCO, say which one is stronger (or that they are incomparable).

- (A multi-unit auction with externalities.) We are running a multi-unit auction for badminton rackets in the town Externa, where nobody owns one yet and we are the only supplier. Of course, being the only person to own a badminton racket is no fun; bidders care about which other bidders win rackets as well. In such a setting, where bidders care about what other bidders win, we say that there areexternalities. Let us assume that each agent is awarded at most one racket, and that shuttlecocks and nets are freely available. In the most general bidding language for this setting, each bidder would specify, for every subset of the agents, what her value would be if exactly the agents in that subset won rackets. This is impractical because there are exponentially many subsets. Instead, we will consider more restricted bidding languages. Let us suppose that it is commonly known which agents live close enough to each other that they could play badminton together. This can be represented as a graph, which has an edge between two agents if and only if they live close enough to each other to play together. In the first bidding language, every agentisubmits a single valuevi. The semantics of this are as follows. If the agent does not win a racket, her utility is 0 regardless of who else wins a racket. If she does win a racket, her value is vtimes the number of her neighbors that also win a racket.

(^3) E.g., not dictatorial rules, rules for which there is a candidate that cant possibly win, randomized rules, etc. Also, approval cannot be one of the rules because it is not based on rankings. If you use Cup, Cup only satisfies a criterion if it satisfies it for every way of pairing the candidates.

```
Alice
```

```
Bob
```

```
Carol Daniel
```

```
Eva
```

```
Frank
```

```
Figure 1: Externas proximity graph.
```

```
Suppose we receive the following bids:
```

```
Alice
```

```
Bob
```

```
Carol Daniel
```

```
Eva
```

```
Frank
```

```
4
```

```
4
```

(^25) 5 4 Figure 2: Graph with bids. The number next to an agent is that agents bid. Suppose we have three rackets for sale. One valid (but not optimal) allo- cation would be to give rackets to Carol, Daniel, and Eva. Carol would get a (reported) utility of 2, Daniel would get 10 (25, because two of Daniels neighbors have rackets), and Eva 5, for a total of 17. 2a. (12 points)Give the optimal allocation, as well as the VCG (Clarke) payment for each agent. 2b. (13 points)In general (general graphs, bids, numbers of rackets), is the problem of finding the optimal allocation solvable in polynomial time, or NP-hard? (Hint: think about theCliqueproblem (which is almost the same as theIndependent Setproblem).) One year has passed, and we have returned to Externa. Everyones rackets have broken (we are not in the business of selling high-quality rackets here) and they need new ones. However, the people in the town were not entirely happy with our previous system. Specifically, it turned out that each agent only ever played with (at most) a single other agent, so that multiplying the value by the number of neighbors with rackets really made no sense. Also, agents have realized that they would receive different utilities for playing with different agents. In the new system, we must not only decide on who receives rackets, but (for the agents who win rackets) we must also decide on the pairing, i.e.,who plays with whom. Each agent can be paired with at most one other agent. Each agentisubmits a valuevijfor every one of her neighborsj; agentireceivesvij if she is paired withj(and both win rackets), and 0 otherwise. Suppose we receive the following bids:

```
Alice
```

```
Bob
```

```
Carol Daniel
```

```
Frank
```

(^12) 4 3 2 1 4 Eva 5 5 6 1 5 Figure 3: Graph with bids. Each number is the value that the closer agent on the edge has for playing with the further agent on the edge. Suppose we have four rackets for sale. One valid (but not optimal) outcome would be to pair Alice and Bob, and Daniel and Eva (and give them all rackets), for a total utility of 4 + 1 + 1 + 6 = 12. 2c. (12 points)Give the optimal outcome (pairing and allocation), as well as the VCG (Clarke) payment for each agent. 2d. (13 points)In general (general graphs, bids, numbers of rackets), is the problem of finding the optimal outcome solvable in polynomial time, or NP- hard? (Hint: think about theMaximum-Weighted-Matchingproblem. Keep in mind that the number of rackets is limited, though.)