A game-theoretic approach to competitive
比赛对手是谁英语作文

In the realm of sports and competitions,the identity of ones opponent can greatly influence the nature and outcome of the contest.When writing an English essay about a competition and its adversaries,it is essential to provide a comprehensive view of the situation.Heres a detailed outline that you can follow to structure your essay:Title:The Identity of Our CompetitionIntroduction:Introduce the context of the competition.Mention the significance of knowing ones competition in achieving success.Paragraph1:The Rivals BackgroundDiscuss the history and reputation of the competition.Highlight their past achievements and strengths that make them formidable opponents.Paragraph2:Our Teams PreparationDescribe how the team has been preparing for the competition.Mention the strategies and training regimens that have been implemented to counter the strengths of the rival.Paragraph3:Psychological AspectExplore the mental game involved in facing a known adversary.Discuss how the teams morale and confidence are affected by the identity of the competition.Paragraph4:The Impact on Fans and SpectatorsReflect on how the identity of the competition affects the audiences anticipation and excitement.Consider the historical rivalries or personal connections that may exist between the teams.Paragraph5:The Approach to the CompetitionElaborate on the teams approach to the competition,including any specific tactics or game plans.Discuss how the teams preparation is tailored to the unique challenges posed by the rival.Paragraph6:The Importance of AdaptabilityEmphasize the need for adaptability in the face of a strong opponent.Discuss how the team plans to adjust its strategies during the competition based on the rivals performance.Conclusion:Summarize the key points discussed in the essay.Conclude with a reflection on the value of facing a worthy opponent and the lessons learned from the competition.Sample Essay:In the world of sports,the identity of our competition is not merely a detail it is a critical factor that shapes our entire approach to a match.The upcoming tournament has pitted us against the Titans,a team with a storied history and a reputation for resilience and strategic prowess.Our team has been preparing diligently,analyzing the Titans past games to identify patterns and weaknesses.We have intensified our training,focusing on both physical conditioning and mental fortitude.The psychological aspect of facing such a renowned opponent is not to be underestimated it tests our resolve and demands that we maintain a high level of confidence and focus.The anticipation among fans is palpable,as many have witnessed the historic clashes between our teams.The identity of our competition has ignited a passion in the spectators, who are eager to see how this rivalry will unfold.Our approach to the competition is multifaceted.We have devised specific tactics to counter the Titans strengths and are prepared to execute a flexible game plan that can adapt to the flow of the match.The importance of adaptability cannot be overstated we must be ready to change our strategies on the fly,responding to the Titans moves with agility and intelligence.In conclusion,while the identity of our competition presents a formidable challenge,it also provides an opportunity for growth and learning.Facing the Titans will test our limits and,ultimately,reveal our true capabilities as a team.Regardless of the outcome, we will have gained invaluable experience and insights that will serve us well in future competitions.。
新视野大学英语第三版读写教程第二册UNIT6课文及翻译(A+B篇)

TEXT ADoor closer, are you?“关门者”,你是吗?1 The next time you're deciding between rival options, one which is primary and the other which is secondary, ask yourself this question: What would Xiang Yu do?下次你要在两个难于取舍的、主要的和次要的选择之间做决定时,不妨问自己这样一个问题:项羽会怎么做?2 Xiang Y u was a Chinese imperial general in the third century BC who took his troops across the Zhang River on a raid into enemy territory. To his troops' astonishment, he ordered their cooking pots crushed and their sailing ships burned.项羽是公元前三世纪中国古代王朝的一位将军。
他带领他的部队横渡漳河,突袭进入了敌方的领地。
他下令砸锅烧船,令他的部队大为震惊。
3 He explained that he was imposing on them a necessity for attaining victory over their opponents. What he said was surely motivating, but it wasn't really appreciated by many of his loyal soldiers as they watched their vessels go up in flames. But the genius of General Xiang Yu's conviction would be validated both on the battlefield and in modern social science research. General Xiang Yu was a rare exception to the norm, a veteran leader who was highly respected for his many conquests and who achieved the summit of success.他解释道,他强加给他们的是战胜对手的必要举措。
科技英语第二次课_game_theory

zero-sum games
In game theory and economic theory, zerosum describes a situation in which a participant's gain or loss is exactly balanced by the losses or gains of the other participant(s).
It attemptslly the actions that “players” should take to secure the best outcomes for themselves in a wide array of “games”.
Game theory was pioneered by Princeton mathematician John von Neumann.
更多具有代表性的例子可能会导致共同得利博弈和共同损 失博弈,同样的情况还会发生在另外一些冲突中。
Princeton
Princeton University is a private research university located in Princeton, New Jersey, United States. The school is one of the eight universities of the Ivy League and is considered one of the Colonial Colleges.
Examples:赌博
More typical are games with the potential for either mutual gain or mutual harm, as well as some conflict.
2024年1月浙江省首考普通高等学校招生全国统一考试英语试题

2024年1月浙江省首考普通高等学校招生全国统一考试英语试题一、阅读理解Tom Sawyer Play Is an AdventureA 35-minute hand-clapping, foot-stomping musical version of a Mark Twain favorite returns with this Tall Stacks festival.“Tom Sawyer: A River Adventure” has all the good stuff, including the fence painting, the graveyard, the island and the cave. It is adapted by Joe McDonough, with music by David Kisor. That’s the local stage writing team that creates many of the Children’s Theatre of Cincinnati’s original musicals, along with the holiday family musicals at Ensemble Theatre.This year Nathan Turner of Burlington is Tom Sawyer, and Robbie McMath of Fort Mitchell is Huck Finn.Tumer, a 10th-grader at School for Creative and Performing Arts, is a familiar presence on Cincinnati’s stages. He is a star act or of Children’s Theatre, having played leading roles in “The Legend of Sleepy Hollow” and “The Wizard of Oz,” and is fresh from Jersey Production “Ragtime”.McMath is a junior at Beechwood High School. He was in the cast of “Tom Sawyer” when it was first performed and is a Children’s Theatre regular, with five shows to his credit. This summer he attended Kentucky’s Governor’s School for the Arts in Musical Theatre.Note to teachers: Children’s Theatre has a study guide demonstrating how math and science can be taught through “Tom Sawyer.” For downloadable lessons, visit the official website of Children’s Theatre.1.Who wrote the music for “Tom Sawyer: A River Adventure”?A.David Kisor.B.Joe McDonough.C.Nathan Turner.D.Robbie McMath.2.What can we learn about the two actors?A.They study in the same school.B.They worked together in ”Ragtime“.C.They are experienced on stage.D.They became friends ten years ago.3.What does Children’s Theatre provide for teachers?A.Research funding.B.Training opportunities.C.Technical support.D.Educational resources.【答案】1.A 2.C 3.D【解析】1.根据第二段中的“It is adapted by Joe McDonough, with music by David Kisor.(本剧由乔·麦克多诺改编,大卫·基索作曲。
云南师范大学英语课程标准慕课答案

云南师范大学英语课程标准慕课答案Paper (试卷) (90 minutes)Part I Dialogue Completion (15 points)Directions: There are 15 short incomplete dialogues in this part, each followed by 4 choices marked A, B, C and D. Choose the best one to complete the dialogue.1. — Would you like to go with me for a movie tonight?—______.() [单选题] *A. You name itB. I hope you don’t mindC. If I can finish my homeworkD. Thank you for inviting me.(正确答案)2. —Oh, I am feeling dizzy now. You know I have just enjoyed much beer. —Really? Don’t you know it is a very important party? ______.() [单选题] *A. Behave yourselfB. Mind how you go(正确答案)C. Mind your own businessD. Watch your back3. —Caroline must have left since your train arrived so late. —To my surprise, I found her waiting for me at the station. —______!() [单选题] *A. What a pityB. How kindC. Good for herD. No kidding(正确答案)4. —Well, it is time for boarding.—______.() [单选题] *A. Nice to meet youB. Have a nice partyC. I hope you will soon feel betterD. I wish you a pleasant journey(正确答案)5. —You have a nice big room.—______.() [单选题] *A. It's not so big as you see itB. I hope soC. I don't know what to sayD. I’m glad you like it(正确答案)6. —Let me repeat. How would you describe your personality? —______.() [单选题] *A. Yes, I got you this timeB. I missed your question just nowC. I think my personality is right for youD. I think I’m responsible and outgoing(正确答案)7. —______ a few questions on the subject of solar energy.—OK, go ahead.() [单选题] *A. I guess I can ask youB. I’d like to ask you(正确答案)C. I’d better ask youD. I want to bother you with8. —This has been very interesting. I'll discuss your plan with my boss. —______.() [单选题] *A. Thank you for your time(正确答案)B. I don't know what to doC. Great. The pleasure is mineD. That sounds fine with me9. —Let’s go picnic this Saturday.—Don't you think it's still a bit chilly at this time of year?—______.() [单选题] *A. No wonderB. Cheer upC. Up to you(正确答案)D. Come on10. —______? —Yes, our family moved in here only a few days ago.— Welcome to the neighborhood.() [单选题] *A. Do you need any helpB. Are you here for holidayC. Are you new here(正确答案)D. What are you doing here11. —Do you mind waiting outside for a moment?—______.() [单选题] *A. Not at all(正确答案)B. Yes, pleaseC. I guess soD. I sure do12. —Thank you all for your attention.—Professor Cohen, ______— Sure.() [单选题] *A. we'd like to thank you anyway.B. I wish you a safe trip hack.C. would you like to take some questions?D. could you expand on it?(正确答案)13. —I’m very sorry for stepping on your foot.—______. It's very crowded on the train.() [单选题] *A. That's right(正确答案)B. Don't worryC. I’ m fineD. Take it easy14. —I'm thinking of keeping a dog, and I wonder if you have any particular policy about animals?—______.() [单选题] *A. Yes, dogs will be out of the question(正确答案)B. Yes, I like dogsC. No, dogs are not good petsD. No, our policy is not particular15. —Would you like to have tea with us?—No, thank you. ______.—You must come again.() [单选题] *A. I wish I can(正确答案)B. I must be goingC. I've had enoughD. I'm all rightPart II Reading Comprehension (40 points)Directions: There are 4 passages in this part. Each passage is followed by 5 questions or unfinished statements. For each of them there are 4 choices marked A, B, C and D. Choose the best one.Passage OneWhen the terrorist attack on September 11th caused people to flee the building, AvremelZelmanowitz risked his own chance of escape by staying behind with his friend and colleague, Ed Beyea, who was Confined to a wheelchair due to a paralysis (瘫痪). Both men lost their lives, but the stray of Avremel’s love and devotion to his friend conveys a life-giving message to all.Avremel never married, and he shared a house with his brother and his family. He was a loving uncle to his brother's children; and he was devoted to caring for his aging parents. He was a “family man” in every sense of the word. At the same time, he had his own life, his varied interests, and a job and friends.When the tragedy occurred, Avremel was age 55, and his friend, Ed Beyea, was age 42. Ed became disabled after a diving accident at age 22, but he managed to work 14 years at Blue Cross since his injury. Both he and Avremel were program analysts who worked on the 27th floor of World Trade Center.They both loved books and music, and they both served as the special uncle of their respective families. Like Avremel, Ed had no children of his own, but he was a father figure to his two nephews after their father died.On the morning of September 11, Ed wanted to wait until he could be securely carried down by several rescue workers, as it was dangerous for someone with his disability to be moved. Avremel wouldn't allow his friend to wait alone when everyone else was fleeing the building, and he stayed with him.In the days that followed, the media learned about Awremel’s selfless act, and the story began to spread. President Bush, in his national prayer address to the American people, referred to Avremel’s act as one of the many “outstanding acts of sacrifice” that were demonstrated by Americans during this crisis.16. What happened to Avremel and Ed during the 9.11 terrorist attack?() [单选题] *A. Avremel rescued Ed at tile cost of his life.B. Both Avremel and Ed gave up their chance of escape.C. Avremel stayed with Ed and both lost their lives.(正确答案)D. Both Avremel and Ed were finally rescued.17. What were the similarities between the two men?() [单选题] *A. Both of them loved hooks and music.(正确答案)B. Both of them were in their 50s.C. Both of them were disabled.D. Both lived with their brother's families.18. Which of the following statements is true according to the passage?() [单选题] *A. Avremel took care of Ed's life after work.B. Avremel liked diving when he was young.C. Ed treated his nephews as his own children.D. Ed became disabled after a driving accident.(正确答案)19. Why did Avremel choose to stay when others were fleeing the building?() [单选题] *A. Because he expected the rescuers to help him.B. Because he tried to carry Ed downstairs.C. Because he thought it was safer to stay inside.D. Because he didn’t want to leave Ed behind.(正确答案)20. The word “address” in the last paragraph means ______.() [单选题] *A. solutionB. speech(正确答案)C. informationD. titlePassage TwoWhat you’ve always heard? We're eating way too much salt. The average American gets about 3.4 grams of sodium every day, far more than the upper limit of 2. 3 grams recommended by the USDA. The Institute of Medicine estimates that reducing sodium intake (摄取量) nationwide could prevent 100,000 deaths every year.The headlines now? It's time to get tough. The New York City health department recently kicked off a national effort to cut the amount of salt in packaged and restaurant food by 25% over five years. 80% of the salt in the average person's diet comes from those sources, not from the saltshaker (盐瓶).But wait! The benefits of salt reduction are surprisingly murky. At least 13 studies have tried to find out what happens to people who choose to eat salty or not-so-salty food—and the results have pointed in every direction. Some studies suggest that cutting salt protects the heart; others suggest that intense salt reduction can actually increase heart problems. What’s needed, Dr. Michael Alderman says, is a randomized (随机的) , controlled trial, in which people are put on different diets and followed for years. It's the only way to get a reliable answer, but it’s never been done.So what should you do? Go easy on processed foods and eat more produce. Those changes will improve your diet in a variety of ways and cut the amount of sodium you consume. If your blood pressure is high, work with your doctor to control it with drugs and lifestyle changes. If your blood pressure is healthy? At this point, there’s no convincing reason for you to count every grain.21. It is stated in Paragraph 1 that our sodium intake ______.() [单选题] *A. is within the healthy rangeB. is a bit over the upper limitC. is far beyond what is necessary(正确答案)D. is well below the lower limit22. The main sources of salt in our diet are ______.() [单选题] *A. home-made food and packaged foodB. restaurant food and saltshakersC. home-made food and saltshakersD. restaurant food and packaged food(正确答案)23. What does the word "murky' (Para. 3) probably mean?() [单选题] *A. Unclear(正确答案)B. SignificantC. ObviousD. Exaggerated24. What does Dr. Michael Alderman say about a randomized, controlled trial?() [单选题] *A. It has been successfully conductedB. It should be carded out.(正确答案)C. It is already under way.D. It is too late to try it.25. As stated in the last paragraph, people with normal blood pressure ______. () [单选题] *A should consider a change of their lifestyleB. have every reason to be careful about sodiumC. will not be affected by the amount of sodium takenD. do not have to take sodium too seriously(正确答案)Passage ThreeThere is a tale that straw is the worst material from which to build a house, particularly if you are a pig with a hungry wolf around. So the cards were stacked against Warren Brush when local officials learned that he had several buildings made of straw bales (大捆) on his land.They have tried to fine him a lot. But the case is still unresolved. The problem is that California's building codes make no provision for the use of straw. And Mr. Brush has many defenders—among them several university scientists and David Eisenberg, the chairman of the United States Green Building Council’s code committee. They would like to see the prejudice against straw houses eliminated, for straw is, in many ways, an ideal building material.It is, for one thing, a great insulator (绝缘体). That keeps down the heating bills in houses made from it. It is also a waste product that would otherwise be burned, and is therefore cheap, and very much to the point in a place like California, it is earthquake-resistant. Last year a test conducted at the University of Nevada showed that straw-bale constructions could withstand twice the amount of ground motion recorded in the Northridge earthquake that hit Los Angeles in 1994.There are other straws in the wind: a post office in suburban Albuquerque, a school inMaryland, and an office complex in suburban Los Angeles have all been built from straw. Even California is having a rethink, and may change its rules to adapt to straw-bale construction. As Mr. Eisenberg observes, “the lesson of the Three Little Pigs isn't to avoid straw. It’s that you don’t let a pig build your house.”26. By “the cards were stacked against Warren Brush”, the author means that Brash______.() [单选题] *A. received punishmentB. made a breakthroughC. would be in trouble(正确答案)D. might win a prize27. David Eisenberg is mentioned ______.() [单选题] *A. as a representative of official opinionsB. for the purpose of supporting Warren Brush(正确答案)C. to provide evidence against straw housesD. to show the importance of the building codes28. What is Paragraph 3 mainly about?() [单选题] *A. The structure of straw houses.B. The possibility of building straw houses.C. The suggestions for building straw houses.D. The advantages of straw houses.(正确答案)29. It can be learned from the last paragraph that California ______.() [单选题] *A. will fine Warren Brush as plannedB. will reduce the fine on Warren BrushC. may consider a heavier fine on Warren BrushD. may not fine Warren Brash(正确答案)30. The author’s purpose in writing the passage is to ______.() [单选题] *A. show that straw can be used to build housesB. highlight the prejudice against straw houses(正确答案)C. explain how to build a house with strawD. introduce a new building materialPassage FourI was talking with a senior Public Relations manager the other day about “The Game Trainers” and he expressed much doubt about both the possibility and value of getting senior professionals to play games.These are serious people with serious jobs, and they are not going to waste time running around like school children, he told me. This statement highlighted many of his assumptions.He also provided me with a golden opportunity to talk about how these “serious people with serious jobs” could actually learn something about themselves, their staff, their company, and their business opportunities by allowing creativity to flow more freely through “games”.His position is not uncommon and it comes from a deep seated misunderstanding of what a “game” is and what it is for, as well as a set notion of what “work” must look like for it to be considered of value. It's not a coincidence (巧合) that the most successful companies of the last decade, including Apple and Google, were all started by college students, and perhaps as a consequence have at their core a spirit of fun,creativity andinnovation. Their success has not been achieved through a strict work environment, dull meetings and a 9 to 5 work time. Instead they have flowing and flexible work spaces, a culture of cooperation, opportunities for creativity and relaxed work structures.The Game Trainers support this innovative and highly productive approach to work by developing games to integrate into the working environment, And so, I said to the PR man, it’s a good thing that they are “serious people with serious jobs”, because we also are extremely serious about play, and in today’s environment they simply cannot afford not to play games.31. What does the PR manager think of the author’s proposal of playing games?() [单选题] *A. It is against the rule.B. It makes no sense.(正确答案)C. It is worth a try.D. It would be beneficial.32. The author suggests that the PR manager’s position on games ______.() [单选题] *A. represents a common misunderstanding(正确答案)B. allows for greater work efficiencyC. is based on scientifically proven conceptsD. is hard to understand in today's world?33. The examples of Apple and Google show that ______.() [单选题] *A. it helps to combine work with games(正确答案)B. games should be separated from workC. work and games can be clearly definedD. no work can be done well without games34. “The Game Trai ners” is probably a ______.() [单选题] *A. computer gameB. search engineC. game developer(正确答案)D. research system35. In the passage the author ______.() [单选题] *A. encourages people to work more creatively(正确答案)B. describes how to balance work with lifeC. analyzes why it is important to enjoy workD. promotes an innovative approach to workPart III Vocabulary and Structure (20 points)Directions: There are 40 incomplete sentences in this part. For each sentence there are 4 choices marked A, B, C and D. Choose the one that best completes the sentence.36. Poor educational performance is sometimes ____ to emotional disturbance.() [单选题] *A. connectedB. related(正确答案)C. associatedD. joined37. The size of the castle and its commanding position still ____ the visitors today.()[单选题] *A. impress(正确答案)B. stressC. affectD. emphasize38. Their home is situated within easy ____ of shops and other facilities.() [单选题] *A. acquisitionB. reach(正确答案)C. possessionD. access39. Lee is coming on very well now and it's a ____ of deciding how to fit him into the team.() [单选题] *A. problemB. matter(正确答案)C. thingD. concern40. Once the excitement of watching TV all day has ____ off, holidays can be boring.() [单选题] *A. shownB. laidC. worn(正确答案)41. Feed plants and they grow; ____ them and they suffer.() [单选题] *A. disgustB. dismissC. omitD. neglect(正确答案)42. It was considered impolite by many to discuss business on social ____.() [单选题] *A. eventsB. momentsC. occasions(正确答案)D. affairs43. Doctors have decided the only way he can live anything near a(n) ____ life is to give him an operation.() [单选题] *A. normal(正确答案)B. ordinaryC. regularD. average44. There are many theories that ____ to be able to predict whether you will give birth toa girl a boy.() [单选题] *A. declareB. claim(正确答案)D. state45. It is very important for the staff to dress in something ____ to the job.() [单选题] *A. properB. approximateC. appropriateD. relevant(正确答案)46. After ____ the numbers in every possible combination, we finally hit on a solution.() [单选题] *A. running through(正确答案)B. running afterC. running overD. running out47. Either he escaped, or he was put in prison, in ____ , he was never seen again.() [单选题] *A. all casesB. every caseC. any case(正确答案)D. no case48. The authorities wouldn’t ____ us permission to fly all the way down to San Francisco.() [单选题] *A. grant(正确答案)B. allowC. provideD. admit49. We should ____ our differences and discuss the things we have in common.() [单选题] *A. put awayB. put aside(正确答案)C. put offD. put forward50. It was only by a great effort of will and courage that he was able to ____ himself together.() [单选题] *A. pull(正确答案)B. putC. dragD. push51. Seldom did we realize that many of our hair problems ____ what we eat.() [单选题] *A. rely onB. refer toC. result from(正确答案)D. respond to52. Mark needs to travel ____ with his varied business interests.() [单选题] *A. extensivelyB. intenselyC. broadlyD. widely(正确答案)53. Even though I'm quite a ____ person, I like meeting people.() [单选题] *A. preservedB. conserved(正确答案)C. deservedD. reserved54. Few people nowadays are able to ____ friendship into their senior years.() [单选题] *A. postponeB. maintain(正确答案)C. withdrawD. insist55. Tile necklace has 96 pieces and they are worth, individually and ____, a lot of money.() [单选题] *A. Wholly(正确答案)B. JointlyC. collectivelyD. completely56. A country ____ birth rate is higher than its death rate will have an increasing population.() [单选题] *A. WhereB. WhichC. thatD. whose(正确答案)57. If you don't agree with me, ____. () [单选题] *A. neither they willB. so won't theyC. neither will they(正确答案)D. so they won't neither58. Although Americans have different views on many issues, they tend to agree ____ one subject: taxes are too high.() [单选题] *A. on(正确答案)B. toC. withD. at59. There is nothing about women ____ careers to look after children.() [单选题] *A. to give upB. give upC. giving up(正确答案)D. will give up60. His sickness, ____ with terrible weather, has completely ruined this long expected trip.() [单选题] *A. combiningB. combined(正确答案)C. to combineD. to be combined61. A recent poll suggested that if money were not an issue, most people ____ not to work at all.() [单选题] *A. should preferB. preferC. would prefer(正确答案)D. preferred62. After ____ seemed to be an endless wait, it was finally his turn to have the interview.() [单选题] *A. thatB. WhenC. What(正确答案)D. which63. It is worth ____ that even the most complex scientific ideas can eventually affect one's daily life.() [单选题] *A. to rememberB. rememberC. rememberedD. remembering(正确答案)64. The degree ____ you maintain your mental health may depend on certain simple environmental factors.() [单选题] *A. WhichB. to which(正确答案)C. thatD. to that65. The demand made by the workers is that their salaries ____ to cover the increased cost of living.() [单选题] *A. increasedB. be increased(正确答案)C. be increasingD. were increased66. He is, by far, and will be for a time ____, the best basketball player in the history of the game.() [单选题] *A. comingB. to come(正确答案)C. to have comeD. to be coming67. When we arrived at the airport, we were told our flight ____.() [单选题] *A. cancelledB. had cancelledC. has been cancelledD. had been cancelled(正确答案)68. Scarcely had they settled in their seats in the cinema ____ the film began.() [单选题] *A. when(正确答案)B. thanC. asD. until69. After careful investigation we find that one of the statements ____ to be untrue.()[单选题] *A. is turned outB. have been turned outC. has turned out(正确答案)D. have turned out70. This project is said ____ right now and so far everything is going on quite smoothly.() [单选题] *A. to have carried outB. having been carried outC. to have been carried outD. to be being carried out(正确答案)71. Without the sun’s light ____ the earth’s surface, no life could exist on the earth.()[单选题] *A. WarmsB. warmedC. warmingD. to warm(正确答案)72. It is generally agreed that the Internet has brought people together ____.() [单选题] *A. more than any inventionB. than any other inventionC. than any other invention has(正确答案)D. more than has any other invention73. ____ the price, it is a thousand times worth it.() [单选题] *A. Whatever(正确答案)B. HoweverC. WhicheverD. Wherever74. How close parents are to their children ____ a strong influence on the character of their children.() [单选题] *A. haveB. has(正确答案)C. havingD. had75. It is high time that the international community ____ together to fight against terrorism.() [单选题] *A. workB. WorksC. worked(正确答案)D. working。
lecture_notes_ch1-4

1IntroductionThis chapter introduces the concept of a game and encourages the reader to begin thinking about the formal analysis of strategic situations.The chapter contains a short history of game theory,followed by a description of“non-cooperative theory”(which the book emphasizes),a discussion of the notion of contract and the related use of“cooperative theory,”and comments on the science and art of applied theoretical work.The chapter explains that the word“game”should be associated with any well-defined strategic situation,not just adversarial contests.Finally,the format and style of the book are described.Lecture NotesThe non-administrative segment of afirst lecture in game theory may run as follows.•Definition of a strategic situation.•Examples(have students suggest some):chess,poker,and other parlor games;tennis,football,and other sports;firm competition,international trade,inter-national relations,firm/employee relations,and other standard economic exam-ples;biological competition;elections;and so on.•Competition and cooperation are both strategic topics.Game theory is a generalmethodology for studying strategic settings(which may have elements of bothcompetition and cooperation).•The elements of a formal game representation.•A few simple examples of the extensive form representation(point out the basiccomponents).Examples and Experiments1.Clap game.Ask the students to stand and then,if they comply,ask them toclap.(This is a silly game.)Show them how to diagram the strategic situationas an extensive form tree.The game starts with your decision about whether toask them to stand.If you ask them to stand,then they(modeled as one player)have to choose between standing and staying in their seats.If they stand,thenyou decide between saying nothing and asking them to clap.If you ask them toclap,then they have to decided whether to clap.Write the outcomes at terminalnodes in descriptive terms such as“professor happy,students confused.”Thenshow how these outcomes can be converted into payoffnumbers.13Instructors' Manual for Strategy:Copyright 2002, 2008 by Joel Watson1INTRODUCTION142.Auction the textbook.Many students will probably not have purchased thetextbook by thefirst class meeting.These students may be interested in pur-chasing the book from you,especially if they can get a good deal.However,quite a few students will not know the price of the book.Without announcingthe bookstore’s price,hold a sealed-bid,first-price auction(using real money).This is a common-value auction with incomplete information.The winning bidmay exceed the bookstore’s price,giving you an opportunity to talk about the“winner’s curse”and to establish a fund to pay students in future classroomexperiments.Instructors' Manual for Strategy:Copyright 2002, 2008 by Joel Watson2The Extensive FormThis chapter introduces the basic components of the extensive form in a non-technical way.Students who learn about the extensive form at the beginning of a course are much better able to grasp the concept of a strategy than are students who are taught the normal formfirst.Since strategy is perhaps the most important concept in game theory,a good understanding of this concept makes a dramatic difference in each student’s ability to progress.The chapter avoids the technical details of the extensive form representation in favor of emphasizing the basic components of games.The technical details are covered in Chapter14.Lecture NotesThe following may serve as an outline for a lecture.•Basic components of the extensive form:nodes,branches.Nodes are wherethings happen.Branches are individual actions taken by the players.•Example of a game tree.•Types of nodes:initial,terminal,decision.•Build trees by expanding,never converging back on themselves.At any placein a tree,you should always know exactly how you got there.Thus,the treesummarizes the strategic possibilities.•Player and action labels.Try not to use the same label for different places wheredecisions are made.•Information sets.Start by describing the tree as a diagram that an externalobserver creates to map out the possible sequences of decisions.Assume theexternal observer sees all of the players’actions.Then describe what it meansfor a player to not know what another player did.This is captured by dashedlines indicating that a player cannot distinguish between two or more nodes.•We assume that the players know the game tree,but that a given player maynot know where he is in the game when he must make any particular decision.•An information set is a place where a decision is made.•How to describe simultaneous moves.•Outcomes and how payoffnumbers represent preferences.15Instructors' Manual for Strategy:Copyright 2002, 2008 by Joel Watson2THE EXTENSIVE FORM16Examples and ExperimentsSeveral examples should be used to explain the components of an extensive form.In addition to some standard economic examples(such asfirm entry into an industry and entrant/incumbent competition),here are a few I routinely use:1.Three-card poker.In this game,there is a dealer(player1)and two potentialbetters(players2and3).There are three cards in the deck:a high card,amiddle card,and a low card.At the beginning of the game,the dealer looks atthe cards and gives one to each of the other players.Note that the dealer candecide which of the cards goes to player2and which of the cards goes to player3.(There is no move by Nature in this game.The book does not deal with movesof Nature until Part IV.You can discuss moves of Nature at this point,but itis not necessary.)Player2does not observe the card dealt to player3,nor doesplayer3observe the card dealt to player2.After the dealer’s move,player2observes his card and then decides whether to bet or to fold.After player2’sdecision,player3observes his own card and also whether player2folded orbet.Then player3must decide whether to fold or bet.After player3’s move,the game ends.Payoffs indicate that each player prefers winning to folding andfolding to losing.Assume the dealer is indifferent between all of the outcomes(or specify some other preference ordering).2.Let’s Make a Deal game.This is the three-door guessing game that was madefamous by Monty Hall and the television game show Let’s Make a Deal.Thegame is played by Monty(player1)and a contestant(player2),and it runs asfollows.First,Monty secretly places a prize(say,$1000)behind one of threedoors.Call the doors a,b,and c.(You might write Monty’s actionsas a ,b ,and c ,to differentiate them from those of the contestant.)Then,without observing Monty’s choice,the contestant selects oneof the doors(by saying“a,”“b,”or“c”).After this,Monty must open one of the doors,but he is not allowedto open the door that is in front of the prize,nor is he allowed to openthe door that the contestant selected.Note that Monty does not havea choice if the contestant chooses a different door than Monty chosefor the prize.The contestant observes which door Monty opens.Notethat she will see no prize behind this door.The contestant then has the option of switching to the other unopeneddoor(S for“switch”)or staying with the door she originally selected(D for“don’t switch”).Finally,the remaining doors are opened and the contestant wins theprize if it is behind the door she chose.The contestant obtains a Instructors' Manual for Strategy:Copyright 2002, 2008 by Joel Watson2THE EXTENSIVE FORM17 payoff1if she wins,zero otherwise.Monty is indifferent between allof the outcomes.For a bonus question,you can challenge the students to draw the extensive formrepresentation of the Let’s Make a Deal game or the Three-Card Poker game.Students who submit a correct extensive form can be given points for the classcompetition.The Let’s Make a Deal extensive form is pictured on the nextpage.Instructors' Manual for Strategy:Copyright 2002, 2008 by Joel Watson2THE EXTENSIVE FORM18Instructors' Manual for Strategy:Copyright 2002, 2008 by Joel Watson3Strategies and the Normal FormAs noted already,introducing the extensive form representation at the beginning ofa course helps the students appreciate the notion of a strategy.A student that doesnot understand the concept of a“complete contingent plan”will fail to grasp the sophisticated logic of dynamic rationality that is so critical to much of game theory.Chapter3starts with the formal definition of strategy,illustrated with some examples.The critical point is that strategies are more than just“plans.”A strategy prescribes an action at every information set,even those that would not be reached because of actions taken at other information sets.Chapter3proceeds to the construction of the normal-form representation,starting with the observation that each strategy profile leads to a single terminal node(an outcome)via a path through the tree.This leads to the definition of a payofffunction.The chapter then defines the normal form representation as comprising a set of players, strategy spaces for the players,and payofffunctions.The matrix form,for two-player,finite games,is illustrated.The chapter then briefly describes seven classic normal form games.The chapter concludes with a few comments on the comparison between the normal and extensive forms.Lecture NotesThe following may serve as an outline for a lecture.•Formal definition of strategy.•Examples of strategies.•Notation:strategy space S i,individual strategy s i∈S i.Example:S i={H,L}and s i=H.•Refer to Appendix A for more on sets.•Strategy profile:s∈S,where S=S1×S2×···×S n(product set).•Notation:i and−i,s=(s i,s−i).•Discuss howfinite and infinite strategy spaces can be described.•Why we need to keep track of a complete contingent plan:(1)It allows theanalysis of games from any information set,(2)it facilitates exploring how aplayer responds to his belief about what the other players will do,and(3)itprescribes a contingency plan if a player makes a mistake.•Describe how a strategy implies a path through the tree,leading to a terminalnode and payoffvector.•Examples of strategies and implied payoffs.19Instructors' Manual for Strategy:Copyright 2002, 2008 by Joel Watson3STRATEGIES AND THE NORMAL FORM20•Definition of payofffunction,u i:S→R,u i(s).Refer to Appendix A for moreon functions.•Example:a matrix representation of players,strategies,and payoffs.(Use anyabstract game,such as the centipede game.)•Formal definition of the normal form.•Note:The matrix representation is possible only for two-player,finite games.Otherwise,the game must be described by sets and equations.•The classic normal form games and some stories.Note the different strategicissues represented:conflict,competition,coordination,cooperation.•Comparing the normal and extensive forms(translating one to the other).Examples and Experiments1.Ultimatum-offer bargaining game.Have students give instructions to others asto how to play the game.Those who play the role of“responder”will have tospecify under what conditions to accept and under what conditions to reject theother player’s offer.This helps solidify that a strategy is a complete contingentplan.2.The centipede game(like the one in Figure3.1(b)if the textbook).As with thebargaining game,have some students write their strategies on paper and givethe strategies to other students,who will then play the game as their agents.Discuss mistakes as a reason for specifying a complete contingent plan.Thendiscuss how strategy specifications helps us develop a theory about why playersmake particular decisions(looking ahead to what they would do at variousinformation sets).3.Any of the classic normal forms.4.The Princess Bride poison scene.Show the“poison”scene(and the few minutesleading to it)from the Rob Reiner movie The Princess Bride.In this scene,protagonist Wesley matches wits with the evil Vizzini.There are two gobletsfilled with wine.Away from Vizzini’s view,Wesley puts poison into one ofthe goblets.Then Wesley sets the goblets on a table,one goblet near himselfand the other near Vizzini.Vizzini must choose from which goblet to drink.Wesley must drink from the other goblet.Several variations of this game can bediagrammed for the students,first in the extensive form and then in the normalform.Instructors' Manual for Strategy:Copyright 2002, 2008 by Joel Watson3STRATEGIES AND THE NORMAL FORM215.A3×3dominance-solvable game,such as the following.The payoffs are in dollars.It is very useful to have the students play a gamesuch as this before you lecture on dominance and best response.This will helpthem to begin thinking about rationality,and their behavior will serve as areference point for formal analysis.Have the students write their strategiesand their names on slips of paper.Collect the slips and randomly select aplayer1and a player2.Pay these two students according to their strategyprofile.Calculate the class distribution over the strategies,which you can lateruse when introducing dominance and iterated dominance.6.Repeated Prisoners’Dilemma.Describe the k-period,repeated prisoners’dilemma.For a bonus question,ask the students to compute the number of strategies forplayer1when k=3.Challenge the students tofind a mathematical expressionfor the number of strategies as a function of k.Instructors' Manual for Strategy:Copyright 2002, 2008 by Joel Watson4Beliefs,Mixed Strategies,and Expected PayoffsThis chapter describes how a belief that a player has about another player’s behavior is represented as a probability distribution.It then covers the idea of a mixed strat-egy,which is a similar probability distribution.The appropriate notation is defined.The chapter defines expected payoffand gives some examples of how to compute it.At the end of the chapter,there are a few comments about cardinal versus ordinal utility(although it is not put in this language)and about how payoffnumbers reflect preferences over uncertain outcomes.Risk preferences are discussed in Chapter25.Lecture NotesThe following may serve as an outline for a lecture.•Example of belief in words:“Player1might say‘I think player2is very likelyto play strategy L.’”•Translate into probability numbers.•Other examples of probabilities.•Notation:µj∈∆S j,µj(s j)∈[0,1], s j∈S jµj(s j)=1.•Examples and alternative ways of denoting a probability distribution:for S j={L,R}andµj∈∆{L,R}defined byµj(L)=1/3andµj(R)=2/3,we canwriteµj=(1/3,2/3).•Mixed strategy.Notation:σi∈∆S i.•Refer to Appendix A for more on probability distributions.•Definition of expected value.Definition of expected payoff.•Examples:computing expected payoffs.•Briefly discuss how payoffnumbers represent preferences over random outcomes,risk.Defer elaboration until later.22Instructors' Manual for Strategy:Copyright 2002, 2008 by Joel WatsonBELIEFS AND EXPECTED PAYOFFS23 Examples and Experiments1.Let’s Make a Deal game again.For the class competition,you can ask thefollowing two bonus questions:(a)Suppose that,at each of his information sets,Monty randomizes by choosing his actions with equal probability.Is it optimal for the contestant to select“switch”or“don’t switch”when she has this choice?Why?(b)Are there conditions(a strategy for Monty)under which it is optimal for the contestant to make the other choice?2.Randomization in sports.Many sports provide good examples of randomizedstrategies.Baseball pitchers may desire to randomize over their pitches,and batters may have probabilistic beliefs about which pitch will be thrown to them.Tennis serve and return play is another good example.11See Walker,M.,and Wooders J.“Minimax Play at Wimbledon,”American Economic Review 91(2001):1521-1538.Instructors' Manual for Strategy: An Introduction to Game Theory Copyright 2002, 2008 by Joel Watson For instructors only; do not distribute.。
A combinatorial characterization of resolution width

A Combinatorial Characterizationof Resolution WidthAlbert Atserias Universitat Polit`e cnica de CatalunyaBarcelona,SpainV´ıctor Dalmau Universitat Pompeu Fabra Barcelona,SpainNovember26,2002AbstractWe provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context offinite model theory.The characterization is tight and purely combinatorial.Ourfirst application of this result is a surprising proof that the minimum space of refuting a3-CNF formula is always bounded from below by the minimum width of refuting it(minus3).This solves a well-known open problem.The second application is the unification of several width lower bound arguments,and a new width lower bound for the Dense Linear Order Principle.Since we also show that this principle has resolution refutations of polynomial size,this provides yet another example showing that the size-width relationship is tight.1IntroductionResolution is one of the most popular proof systems for propositional logic.Since Haken[Hak85] proved an exponential lower bound for the smallest resolution proofs of the Pigeonhole Principle,its strength has been studied in depth.The focus has been put in two related directions:(1)proving strong lower bounds for interesting tautologies arising from combinatorial principles[Urq87,CS88,BP96,BSW01,ABSRW00, Raz02a,Raz02b],and(2)the study of the complexity offinding resolution proofs[BP96,BSW01,AR01, AB02].This research is still ongoing,and it seems that further study in both directions is necessary in order to completely understand the power of resolution.An important step towards the understanding of the strength of resolution in a unified way was made by Ben-Sasson and Wigderson[BSW01]with the introduction of the width measure.The width of a resolution refutation is the size of the largest clause in the refutation.The main result of Ben-Sasson and Wigderson, building upon the work of Clegg,Edmonds and Impagliazzo[CEI95]and Beame and Pitassi[BP96],is the following:if a3-CNF formula with variables has a resolution refutation of size,then it has a resolu-tion refutation of widthwidth and pebble games are intimately related.More specifically,we prove that has a resolution refutationof width if and only if the Spoiler wins the existential-pebble game on and.Thus,existential -pebble games provide a purely combinatorial characterization of resolution width.The new characterization allows us to re-derive,in a uniform way,essentially all known width lowerbounds.Moreover,an increase of insight generally reverts in the acquisition of new results.This case isno exception.Ourfirst application of the combinatorial characterization is a surprising result relating thespace and the width in resolution.The space measure was introduced by Esteban and Tor´a n[ET99](seealso[ABSRW02]).Intuitively,the minimal resolution space of refuting a CNF formula is the numberof clauses that are required to be kept in a blackboard(memory)if we insist that the refutation must beself-contained.This measure is referred to as the clause space by Alekhnovich,Ben-Sasson,Razborovand Wigderson[ABSRW02].Strong space lower bounds were proved in the literature for well-knowntautologies such as the Pigeonhole Principle[Tor99,ABSRW02],Tseitin Tautologies[Tor99,ABSRW02],Graph Tautologies[ABSRW02],and Random Formulas[BSG01]to cite some.Our new result is that theminimum space of refuting an-CNF formula is always bigger than the minimum width of refutingminus.In symbols,.Thus,for-CNF formulas with small,space lower boundsfollow at once from width lower bounds.We remark that Tor´a n[Tor99]already obtained this result for therestricted case of tree-like resolution,but the general case remained open since then.Our result confirms theconjecture of Ben-Sasson and Galesi[BSG01]and answers questions posed by Esteban and Tor´a n[ET99],and Alekhnovich,Ben-Sasson,Razborov and Wigderson[ABSRW02].The second application of our result is a new width lower bound.We consider the Dense Linear OrderPrinciple,suggested by Urquhart and used by Riis[Rii01],and stating that nofinite linear order isdense.We show that every resolution refutation of requires width at least,where is the numberof elements of the linear order.We want to make the point that the significance of this result is not so muchthe width lower bound itself,but rather,the techniques that are involved and that we discuss next.Most of the tautologies studied in the literature,including,have large initial width.Consequently,in order to get meaningful width lower bounds it is necessary to convert them into equivalent and short(generally3-CNF)formulas in a preliminary step.Unfortunately,it is usually the case that the resultingformula looses some of the intuitive appeal of the principle it expresses.Furthermore,in a width lowerbound proof,dealing with the auxiliary variables is usually simple but cumbersome and laborious.Tosimplify this situation we define a variant of the pebble game,called extended pebble game,that can beplayed directly over formulas with large clauses and that hides all the technical details,such as the processof dividing large clauses,the introduction of auxiliary variables and its treatment,inside the proof of itsmain property.In particular,the width lower bound for the is obtained this way.We complete thepicture about by showing that it has polynomial-size resolution proofs.Thus,the principleprovides a new example requiring large width but having small resolution proofs(see[BG01,AR01,AB02]for further discussion on this).2PreliminariesLet be a set of propositional variables.A literal is a variable or the negation of a variable.A clauseis a set of literals.If a clause has exactly literals,we call it a-clause.An-CNF formula is a set of-clauses.Alternatively,clauses may be viewed as disjunctions of literals,and CNF formulas may be viewedas conjunctions of clauses.A partial truth assignment to is any function where. We say that falsifies a clause if it sets all literals from to.Dually,we say that satisfies if it setssome literal from to.In all other cases we say that leaves undecided.Resolution is a refutationsystem that works with clauses.The only rule is the so-called resolution rule:3Combinatorial characterization as gamesIt is well know that-CNF formulas may be encoded asfinite relational structures.Indeed,letbe thefinite relational language that consists of relations of arity each.An-CNF formula over the propositional variables is encoded as an-structure as follows.The domain of is the set of variables.For each,the relation encodes the set of clauses of with exactly negated variables.More precisely,the interpretation of consists of all-tuples of the formsuch that is a clause of.Next we define a particular-CNF formula whose encoding is of our interest.The clauses of are all the-clauses on the variables and that are satisfied by the truth assignment that maps to,and to.We will consider the particular case of the existential-pebble game that is played on the structures and.Observe that each partial homomorphism from to may be viewed as a partial truth assignment to the variables of that does not falsify any clause from.Thus,the existential -pebble game on and may be reformulated as follows.Definition2Let be an-CNF formula.We say that the Duplicator wins the Boolean existential-pebble game on if there is a nonempty family of partial truth assignments that do not falsify any clause from such that(i)If,then.(ii)If and,then.(iii)If,,and is a variable,then there is some such that and .We say that is a winning strategy for the Duplicator.We stress on the fact that this definition is only a particular case of the definition of winning strategy for the existential-pebble game defined in Section2.Lemma1If there is no resolution refutation of of width,then the Duplicator wins the existential -pebble game on.Proof:Let be all clauses generated by resolution of width at most from.Let be the set of all partial truth assignments with domain of size at most that do not falsify any clause in.We will see that is a winning strategy.Clearly is not empty since it contains the partial truth assignment with empty domain(note that does not contain the empty clause).Clearly,is closed under projections.Now,let be any partial truth assignment in with,and let be any variable not in.Let us assume that there does not exist a valid extension of to in.In this case let be the clause falsified by the extension of that maps to.Clearly since otherwise would falsify.Analogously there exits some of the form that is falsified by the extension of that maps to.Thus,falsifies.However,has width at most since all its variables are in.Lemma2If the Duplicator wins the existential-pebble game on,then there is no resolution refutation of of width.Proof:Let be a winning strategy for the Duplicator for the existential-pebble game on.We will show by induction in the resolution proof of width that no partial truth assignment in falsifies a clause of the proof.Thus,the proof cannot be a refutation.The statement is clearly satisfied by the initial clauses since we are dealing with partial truth assignments that do not falsify any clause of.Letand be clauses of the proof,and let be the result of applying the resolution rule.Let be any partial truth assignment in.If the domain of does not include all the variables in then we are done since it cannot falsify it.Otherwise consider the projection of to the variables in.We will show that(and hence)does not falsify.Since the width of is at most,the domain of has size at most.Therefore,there exists some extension of to such that is in.By induction hypothesis does not falsify any of and.Consequently,since falsifies or, cannot falsify either.Combining these two lemmas we obtain the main result of this section.We say that the Spoiler wins the existential-pebble game on if the Duplicator does not win the existential-pebble game on.Theorem2Let be an-CNF formula.Then,has a resolution refutation of width if and only if the Spoiler wins the Boolean existential-pebble game on.We note that the existential-pebble game does not talk about resolution at all.Thus,this provides a purely combinatorial characterization of resolution width.4Application:Width bounds space from belowIn this section we show that the resolution space introduced by Esteban and Tor´a n[ET99]and by Alekhnovich,Ben-Sasson,Razborov and Wigderson[ABSRW02]is tightly related to the width.Indeed,for an-CNF formula,the minimal space of refuting,is always bounded from below by, where is the minimal width of refuting.This solves an open problem in[Tor99,ABSRW02, BSG01].We start with some definitions.Let be an-CNF formula.A configuration is a set of clauses.A sequence of configurations is a self-contained resolution proof if and for,the configuration is obtained from by one of the following rules:(i)Axiom Download:for some,(ii)Erasure:for some,(iii)Inference:for some that is obtained from an application of the resolution rule on two clauses from.The space of a self-contained resolution proof is the maximum of for.A self-contained resolution refutation is a self-contained resolution proof whose last configuration is.The minimal space of refuting an unsatisfiable formula,denoted by,is the minimal space of all self-contained resolution refutations of.We will need the following easy lemma.Lemma3(Locality Lemma[ABSRW02])Let be a partial truth assignment and let be a set of clauses. If satisfies,then there exists a restriction such that and still satisfies. Proof:For every,let be a literal that is satisfied by.For every,let be the underlying variable.Finally,let be the projection of to.Lemma4Let be an unsatisfiable-CNF formula,and let.If the Duplicator wins the Boolean existential-pebble game on,then the minimal space of refuting is at least.Proof:Let be a winning strategy for the Duplicator in the existential-pebble game on.We show that if is a self-contained resolution proof of space less than,then every is satisfiable. This will prove that cannot have a resolution refutation of space less than.We build,by induction on,a sequence of partial truth assignments such that satisfies and.In the following, let.Let.In order to define for,suppose that has already been defined.Weconsider the three possible scenarios for.Case1:by an axiom download for.Let be an extension of such that all variables in are in.Since, and is an-clause,such an exists in.Moreover,since does not falsify any clause from ,and since all variables in are defined,satisfies.Therefore,satisfies.Now,by the Locality Lemma,there exists some restriction such that and still satisfies and belongs to .Let.Case2:by an inference.In this case set.The soundness of the resolution rule guarantees that satisfies.Of course,and.Case3: by a memory erasure.Obviously,still satisfies since it satisfies.Now,by the Locality Lemma,there is a restriction of such that and still satisfies and belongs to.Let.Theorem3Let be an unsatisfiable-CNF formula.Then,where is the minimal space of refuting in resolution,and is the minimal width of refuting in resolution.We note that this theorem can be used to derive space lower bounds for all formulas for which width lower bounds are known such as the Pigeonhole Principle,Tseitin Formulas,Random Formulas,and so on. 5Application:Unified width lower boundsThe new characterization of the width can be used to obtain width lower bounds in a simpler and unified way.For CNF formulas whose clauses are already small,the width lower bound is obtained directly by exhibiting a winning strategy for the Duplicator.We illustrate this point with the encoding of the Pigeonhole Principle into an unsatisfiable3-CNF formula by means of auxiliary variables(the so-called standard non-deterministic extension).We will consider the-CNF formula encoding the negation of the Pigeonhole Principle. For every and,let be a propositional variable meaning that pigeon sits in hole.For every and,let be a new propositional variable.The following-CNF formula expresses that pigeon sits in some hole:Finally,the-CNF formula expressing the negation of the Pigeonhole Principle is the conjunc-tion of all and all clauses for,and. Lemma5The Duplicator wins the Boolean existential-pebble game on.Proof:Let be the set of all one-to-one partial functions from into.For every ,define a partial truth assignment as follows:(i)if is defined and,(ii)if is defined and,(iii)if is defined and,(iv)if is defined and.Let,and let be the set of restrictions of assignments of to all sets of at most variables.It is straightforward to check that is a winning strategy for the Duplicator.We claim that all width lower bounds in the literature can be easily re-derived by exhibiting a winning strategy for the Duplicator.For example,[Ats02]provided a winning strategy for the Duplicator for random formulas,and thus width lower bounds are also derived for them.Our next twist is an attempt to systematize the use of the extension variables such as the’s in .The point is that we would like to play games on CNF formulas with arbitrarily long clauses, and derive meaningful width lower bounds for their standard non-deterministic extensions.For an arbitrary CNF formula without any restriction on the length of its clauses,let us define an equivalent-CNF for-mula for.Such a formula is called the standard non-deterministic extension of in[ABSRW02].For every clause of length at most,let.For every clause of length,let be a collection of new variables.Then we define as follows:Then,is the conjunction of all.Note that is now an-CNF formula and it is unsatisfi-able if and only if is.The aim of the following definitions is to formalize a variation on the existential-pebble game that is tailored for the non-deterministic extensions that we just introduced.Let be a CNF formula without any restriction on the length of its clauses.Let be the set of propositional variables of.An extended partial truth assignment is a pair where and is partial truth assignment.Moreover, if,then and clause is satisfied by setting to (note that is always satisfied).If and are extended partial truth assignments, we say that is an extension of,denoted by,if and.We also say that is a projection of.We say that an extended partial truth assignment does not falsify a clause if does not falsify it.Definition3We say that the Duplicator wins the extended-game on if there is a nonempty family of extended partial truth assignments that do not falsify any clause of such that(i)If,then.(ii)If and,then there is some such that.(iii)If,,and,then there is some such that and. (iv)If,,and has length at least,then there is some and some such that and.The main result about this new game is the following lemma.Lemma6If the Duplicator wins the extended-game on,then the Duplicator wins the Boolean existential-pebble game on.Proof:Let be a winning strategy for the-game on.Wefirst claim that we may assume without loss of generality that every extended partial truth assignment in is such that if and for some,then.Indeed,let be the set of all extended partial truth assignments that are obtained from those in in the following way:Given a partial truth assignment,where with,obtain an extended partial truth assignment for each choice ofand put all of them in.It is not hard to see that is also a winning strategy for the-game on.Now,let be an extended partial truth assignment.We define an ordinary partial truth assignment as follows:(i)The domain of is the set of all such that for some,together withall variables such that for some and.(ii)If for some,then.(iii)If for some,let be the literal of corresponding to variable and set if and if(here is where we use the assumption about the uniqueness of).First notice that each is a partial truth assignment to the variables of that does not falsify any clause from.Moreover,if,then.Now,we construct our winning strategy by including, for every,every partial truth assignment such that and.Conditions(i) and(ii)in Definition2are obviously satisfied.Let us consider condition(iii).Let be such that .Then,there exists such that.Since,there exists a projection such that and.Let.Let be an initial variable.By the extended forth property there is an such that and.Thuswhere.Then,the projection of to the variables in is an extension of that belongs to and has in its domain.Now let be an extension variable of clause with. We have to consider two cases:(1)for some,and(2)otherwise.In case(1),the projection of to the variables in is an extension of that belongs to and has in its domain.In case(2),there exists some variable and such that and.This time where,and the projection of to the variables in is an extension of that belongs to and has in its domain.There is a strong reason to claim that the definition of the-game is not arbitrary.Indeed,a sharp converse to Lemma6holds as one can easily see:if the Duplicator wins the Boolean existential-pebble game on,then the Duplicator wins the-game on.Thus,we loose essentially nothing in restricting ourselves to playing the modified game on.We illustrate its use for the set of clauses expressing the Dense Linear Order Principle which says that afinite linear order cannot be dense.For every,let be a propositional variable whose intended meaning is that is smaller than in the linear ordering.For every,let be a propositional variable whose intended meaning is that is smaller than,and is smaller than in the linear ordering.The clauses of are the following:where and in(2).Since has large clauses,we employ the-game introduced above.Lemma7The Duplicator wins the extended-game on,and therefore,every resolution refu-tation of requires width.Proof:For every linear ordering on,let be the extended partial truth assignment with domain where,,,and.The mapping is defined as if and otherwise and if and otherwise.By the way it is defined,is an extended partial truth assignment.We define our winning strategy as the set containing every for some linear ordering on such that.Thus,satisfies conditions(i)and(ii)of extended winning strategy. We will show that condition(iii)is also satisfied.Let be any element of with.For any,is in the domain of,and,in consequence,the projection of with domainbelongs to.Analogously,for every,is in and consequently,the projection of with domain is also in.Let us consider now condition(iv).Let be a subset of containing all the indices in referenced in.That is,contains and if is in for some,and con-tains,,and if is in for some.Since then.Let be an arbitrary pair of indices on.We will show that there exists a linear order on such that(1)and coincide on,i.e.,for every,iff,and(2)the domain of contains for some.Thus,the projection of to belongs to.To construct we do the following:if and belong to and then wefix to be a linear ordering that coincides with on and such that for some not in.It is immediate to see that such always exists and that.Otherwise,we canfind some linear ordering that coincides with on and such that.In this case.We stress on the fact that the introduction of the new game was motivated by an attempt to generalize the construction of winning strategies in the presence of auxiliary variables.A winning strategy for the Duplicator in the original game on the non-deterministic extension could also be easily found directly.To complete this section,in view of the width lower bound that we just proved,it is quite interesting that has a resolution refutation of polynomial size as we show next.Theorem4The set of clauses,and therefore,has a resolution refutation of size.Proof:The idea of the proof is to derive the clauses for every and.Once this is done,from we obtain for everyby a cut with which is derived from and(5)(observe that is simply(1)in the particular case).Then we obtain for every by a cut with(2),and for every by a cut with(6).Then we eliminate all occurrences of all variables,in, and from(7).The resulting formula would contain a copy of up to renaming of indices.In order to derive,observe that each is an initial clause.Observe too that is derived at once from and the initial clauses since cannot be true.To derive from for,cut and(6)on to obtain.Then combine this with and the initial clauses(3)expressing transitivity to obtain.Therefore,the Dense Linear Order Principle is another example of a tautology witnessing the impossi-bility of improving the size-width relationship of Ben-Sasson and Wigderson.We note that the width lower bound for(also known as the Minimum Principle)due to Bonet and Galesi could also be derived using Lemma6and a game theoretic argument.6ConclusionsWe have provided a charaterization of the resolution width in terms of the existential pebble game which was introduced in the context offinite model theory.In that context,the game was used as a tool to obtain non-expressibility results for the existential positive fragment of infinitary logic withfinitely many variables which subsumes Datalog.Our result indicates that there is a tight connection between both areas,and also with the area of the theory of constraint satisfaction problems since existential pebble games play an important role there[KV00a,KV00b,DKV02].We think it is worth exploring further these connections. In particular,it is an interesting project to try to establish a precise connection between definability in the existential positive fragment of infinitary logic withfinitely many variables and the prover-liar games of Buss and Pudl´a k[PB95],and to interpret and use that correspondence in bothfields.Our results may also have some impact on the algorithmic aspects of resolution that we discuss next. From the know results in the area of constraint satisfaction problems,it is not hard to prove that the Duplica-tor wins the existential-pebble game on structures and if and only if every structure of tree-width less than that maps homomorphically to also maps homomorphically to[FV98].In view of our results, this is interpreted as follows in the context of resolution:a3-CNF formula requires resolution width if and only if every3-CNF formula of tree-width less than that maps homomorphically to is satisfiable. This explains why formulas of small tree-width have small resolution proofs and sheds some more light on the recent algorithmic results of Alekhnovich and Razborov[AR02].We believe these connections should be explored further.References[AB02] A.Atserias and M.L.Bonet.On the automatizability of resolution and related propositional proof systems.In Computer Science Logic’2002,16th Annual Conference of the EACSL,volume2471of Lecture Notes in Computer Science,pages569–583.Springer,2002. [ABSRW00]M.Alekhovich,E.Ben-Sasson,A.A.Razborov,and A.Wigderson.Pseudorandom generators in propositional proof systems.In41st Annual IEEE Symposium on Foundations of ComputerScience,2000.[ABSRW02]M.Alekhnovich,E.Ben-Sasson,A.Razborov,and A.Wigderson.Space complexity in propo-sitional calculus.SIAM Journal of Computing,31(4):1184–1211,2002.A preliminary versionappeared in STOC’00.[AR01]M.Alekhnovich and A.A.Razborov.Resolution is not automatizable unless W[P]is tractable.In42nd Annual IEEE Symposium on Foundations of Computer Science,2001.[AR02]M.Alekhnovich and A.Razborov.Satisfiability,branch-width and Tseitin tautologies.In 43rd Annual IEEE Symposium on Foundations of Computer Science,pages593–603,2002. [Ats02] A.Atserias.Unsatisfiable random formulas are hard to certify.In17th IEEE Symposium on Logic in Computer Science,pages325–334,2002.[BG01]M.L.Bonet and N.Galesi.Optimality of size-width trade-offs for resolution.Journal of Computational Complexity,2001.To appear.A preliminary version appeared in FOCS’99.[BP96]P.Beame and T.Pitassi.Simplified and improved resolution lower bounds.In37th Annual IEEE Symposium on Foundations of Computer Science,pages274–282,1996.[BSG01] E.Ben-Sasson and N.Galesi.Space complexity of random formulas in resolution.In16th IEEE Conference on Computational Complexity,pages42–51,2001.[BSW01] E.Ben-Sasson and A.Wigderson.Short proofs are narrow–resolution made simple.Journal of the ACM,48(2):149–169,2001.[CEI95]M.Clegg,J.Edmonds,and ing the Groebner basis algorithm tofind proofs of unsatisfiability.In27th Annual ACM Symposium on the Theory of Computing,1995. [CS88]V.Chv´a tal and E.Szemer´e di.Many hard examples for resolution.Journal of the ACM, 35(4):759–768,1988.[DKV02]V.Dalmau,Ph.G.Kolaitis,and M.Y.Vardi.Constraint satisfaction,bounded treewidth,and finite variable logics.In CP2002,2002.[EF95]H.Ebbinghaus and J.Flum.Finite Model Theory.Springer-Verlag,1995.[ET99]J.L.Esteban and J.Tor´a n.Space bounds for Resolution.In16th International Symposium on Theoretical Aspects of Computer Science,pages530–539,1999.[FV98]T.Feder and M.Y.Vardi.The computational structure of monotone monadic SNP and con-straint satisfaction:A study through Datalog and group theory.SIAM Journal of Computing,28(1):57–104,1998.[Gro98]M.Grohe.Finite variable logics in descriptive complexity theory.Bulletin of Symbolic Logic, 4:345–398,1998.[Hak85] A.Haken.The intractability of resolution.Theoretical Computer Science,39:297–308,1985.[KV95]Ph.G.Kolaitis and M.Y.Vardi.On the expressive power of Datalog:tools and a case study.Journal of Computer and System Sciences,51:110–134,1995.[KV00a]Ph.G.Kolaitis and M.Y.Vardi.Conjunctive-query containment and constraint satisfaction.Journal of Computer and System Sciences,61(2):302–332,2000.[KV00b]Ph.G.Kolaitis and M.Y.Vardi.A game-theoretic approach to constraint satisfaction.In7th National Conference on Artificial Intelligence,pages175–181,2000.[PB95]P.Pudl´a k and S.R.Buss.How to lie without being(easily)convicted and the lengths of proofs in propositional calculus.In Pacholski and Tiuryn,editors,Computer Science Logic’94,volume933of Lecture Notes in Computer Science,pages151–162.Springer-Verlag,1995.[Raz02a]R.Raz.Resolution lower bounds for the weak pigeonhole principle.In34th Annual ACM Symposium on the Theory of Computing,2002.To appear.[Raz02b] A.A.Razborov.Resolution lower bounds for perfect matching principles.In17th IEEE Conference on Computational Complexity,pages29–38,2002.。
满分英语高考试卷

Section I: Reading ComprehensionPassage 1:Read the following passage and answer the questions that follow.The rapid advancement of technology in the 21st century has revolutionized the way we live, work, and communicate. One of the most significant developments has been the rise of artificial intelligence (AI). AI systems are now capable of performing complex tasks that were once exclusive to humans, such as language translation, medical diagnosis, and even artistic creation.Despite the numerous benefits of AI, there are concerns about its impact on society. Critics argue that AI could lead to job displacement, as machines become more efficient than humans in certain tasks. They also express worries about the ethical implications of AI, such as the potential for bias in decision-making algorithms and the risk of AI systems becoming uncontrollable.Proponents of AI, however, believe that it will create new job opportunities and improve the quality of life. They argue that AI will free humans from mundane tasks, allowing them to focus on more creative and fulfilling endeavors. Moreover, AI has the potential to enhance human decision-making by providing data-driven insights and predictions.The debate over AI's impact on society is likely to continue as the technology evolves. It is crucial for policymakers, businesses, and individuals to understand both the opportunities and challenges presented by AI. By doing so, they can ensure that AI is developed and implemented in a way that maximizes its benefits while minimizing its risks.Questions:1. What are two main concerns expressed by critics of AI?2. How do proponents of AI argue that it will improve the quality of life?3. What is the main point of the passage?Passage 2:Read the following passage and answer the questions that follow.In recent years, the environmental movement has gained significant momentum worldwide. People are becoming increasingly aware of the urgent need to address climate change and protect the planet. One of the most effective ways to combat climate change is through the adoption of renewable energy sources.Renewable energy, such as solar, wind, and hydroelectric power, has several advantages over traditional fossil fuels. Firstly, it is a clean and sustainable source of energy, which reduces greenhouse gas emissions and helps mitigate climate change. Secondly, renewable energy is abundant and inexhaustible, ensuring a reliable energy supply for future generations. Finally, investing in renewable energy can create jobs and stimulate economic growth.However, the transition to renewable energy faces several challenges. One of the main challenges is the high initial cost of setting up renewable energy infrastructure. Additionally, some renewable energy sources, such as solar and wind, are intermittent and depend on weather conditions, which can make them less reliable than fossil fuels.Despite these challenges, the global trend towards renewable energy is undeniable. Many countries are setting ambitious targets for renewable energy adoption, and technological advancements are making renewable energy more efficient and cost-effective. As a result, the future of renewable energy looks promising, and it is crucial for the world to continue investing in this crucial sector.Questions:1. What are three advantages of renewable energy over fossil fuels?2. What are two main challenges faced by the transition to renewable energy?3. What is the author's overall perspective on the future of renewable energy?Section II: WritingTask 1: EssayWrite an essay in which you discuss the importance of cultural exchange programs for students. You should provide specific examples to support your points and explain how these programs can benefit both the students involved and the societies they come from.Task 2: CompositionWrite a composition in which you describe a memorable experience you had with a teacher. You should explain why this experience was significant to you and how it influenced your education or personal growth.Section III: Language UsageTask 1: GrammarCorrect the errors in the following sentences.1. The government has announced plans to invest in infrastructure, which will improve the quality of life for citizens.2. If I were in your position, I would take a different approach to solving the problem.3. The movie was so compelling that it kept me on the edge of my seatfor the entire two hours.Task 2: VocabularyChoose the correct word from the list below to complete each sentence.1. The manager was praised for his __________ leadership style.2. The new policy aims to __________ the gap between rich and poor.3. The explosion caused a __________ in the local economy.Section IV: Listening ComprehensionListen to the following dialogue and answer the questions that follow.Dialogue:Two friends are discussing their plans for the weekend.Questions:1. What is the first activity they plan to do on Saturday?2. Why does the second friend suggest visiting the art gallery instead of the museum?3. How do they feel about the weather forecast for Sunday?Section V: WritingTask 1: LetterWrite a letter to a friend who is planning to visit your city. In your letter, describe the city and some of the interesting places and events they should check out.Task 2: EssayWrite an essay in which you discuss the importance of reading for personal and professional development. You should provide examples from your own experience or from the experiences of others to support your points.End of Examination。
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
A Game-Theoretic Approach to Competitive Spectrum Sharing in Cognitive Radio Networks
Dusit Niyato and Ekram Hossain Dept. of Elect. and Comp. Engg., University of Manitoba Winnipeg, MB R3T 5V6, Canada Email: {tao,ekram}@ee.umanitoba.ca
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the WCNC 2007 proceedings.
Dynamic spectrum sharing is a challenging problem in cognitive radio network due to the requirement of “peaceful” coexistence of both licensed and unlicensed users as well as the availability of wide range of radio spectrum. Decision theory (e.g., Markov decision process, game theory) has been identified as one of the key techniques for designing cognitive radio [2]. Single-player decision making technique was used for this in the literature. For example, a partially observable Markov decision process (POMDP) was used for dynamic spectrum access in an ad hoc network [4]. An opportunistic spectrum access method was developed to allow secondary users to access the radio spectrum by using a decentralized cognitive medium access control (MAC) protocol. On the other hand, game theory can be used for multi-player optimization to achieve individual optimal solution. In [5], a game-theoretic adaptive channel allocation scheme was proposed for cognitive radio networks. In this paper, we consider the problem of dynamic spectrum sharing in a cognitive radio network. In such an environment, there is a primary user allocated with a licensed radio spectrum the utilization of which could be improved by sharing it with the secondary users. We formulate this spectrum sharing problem as an oligopoly market in which a few firms compete with each other in termБайду номын сангаас of amount of commodity supplied to the market to gain the maximum profit. In this case the secondary users are analogous to the firms who compete for the spectrum offered by the primary user and the cost of the spectrum is determined by using a pricing function. A Cournot game is used to analyze this situation and the Nash equilibrium is considered as the solution of this game. The main objective of this Cournot game formulation is to maximize the profit of all secondary users based on the equilibrium adopted by all secondary users. However, the parameter of the pricing function offered by the primary user can be adjusted to maximize its revenue as well. We first consider that case where all of the secondary users can completely observe the strategies adopted by each user and the corresponding payoffs. A static Cournot game is used and the Nash equilibrium can be obtained in a centralized fashion. However, in some practical systems this assumption may not be valid (e.g., where the secondary users are out of transmission range of each other and they can only communicate with the primary user). For these scenarios, we use a dynamic Cournot game in which selection of the strategy by a secondary user is based only on the pricing information from the primary user. With this spectrum sharing scheme, we study the stability condition for the Nash equilibrium by using local stability analysis.
This work was supported by a scholarship from the TRLabs, Winnipeg, Canada, and in part by the Natural Sciences and Engineering Research Council (NSERC) of Canada.
Abstract— “Cognitive radio” is an emerging technique to improve the utilization of radio frequency spectrum in wireless networks. In this paper, we consider the problem of spectrum sharing among a primary user and multiple secondary users. We formulate this problem as an oligopoly market competition and use a Cournot game to obtain the spectrum allocation for secondary users. Nash equilibrium is considered as the solution of this game. We first present the formulation of a static Cournot game for the case when all secondary users can observe the adopted strategies and the payoff of each other. However, this assumption may not be realistic in some cognitive radio systems. Therefore, we formulate a dynamic Cournot game in which the strategy of one secondary user is selected solely based on the pricing information obtained from the primary user. The stability condition of the dynamic behavior for this spectrum sharing scheme is investigated.
Keywords-Spectrum sharing, cognitive radio, game theory, Nash equilibrium, stability analysis. I. I NTRODUCTION Frequency spectrum, which is the scarcest resource for wireless communications, may become congested to accommodate diverse type of users, applications, and air interfaces in the next generation wireless networks. The concepts of software defined radio and cognitive radio were introduced to enhance the efficiency of frequency spectrum usage [1]. Software radio improves the capability of a wireless transceiver by using embedded software to enable the radio transceiver to operate in multiple frequency bands by using multiple transmission protocols. Cognitive radio is a special type of software defined radio which is able to estimate the communication parameters (e.g., spectrum sharing and allocation) and can intelligently adapt itself to the changing environment. Intelligent decision making algorithms are keys to the implementation of cognitive radio to achieve the desired system objectives (e.g., maximize throughput and channel utilization). An introduction to cognitive radio techniques was provided in [2] where the fundamental cognitive tasks as well as the emergent behavior of cognitive radio were discussed. In [3], a comprehensive survey of the functionalities and research challenges in cognitive radio networks (also referred to as NeXt Generation (xG) networks) was presented. The key functions and implementation aspects for this xG network including spectrum management, spectrum mobility, and spectrum sharing were discussed.