ISBN: 9783540543725 - Balanced Silverman Games on General Discrete Sets: 365 (lecture Notes in Economics and Mathematical Systems, 365) (13 results)

Condition: Fine. *FREE domestic shipping until Monday, October. 19* 140 pp., Paperback, fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.…

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New. In English.

Condition: New. pp. v + 140 Softcover Reprint of the Original 1st Edition 1991.

Paperback. Condition: Brand New. 140 pages. 9.53x6.69x0.35 inches. In Stock.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - A Silverman game is a two-person zero-sum game defined in terms of two sets S I and S II of positive numbers, and two parameters, the threshold T 1 and the penalty v 0. Players I and II independently choose numbers from S I and S II, respectively. The higher number wins 1, unless it is at least T times as large as the other, in which case it loses v. Equal numbers tie. Such a game might be used to model various bidding or spending situations in which within some bounds the higher bidder or bigger spender wins, but loses if it is overdone. Such situations may include spending on armaments, advertising spending or sealed bids in an auction. Previous work has dealt mainly with special cases. In this work recent progress for arbitrary discrete sets S I and S II is presented. Under quite general conditions, these games reduce to finite matrix games. A large class of games are completely determined by the diagonal of the matrix, and it is shown how the great majority of these appear to have unique optimal strategies. The work is accessible to all who are familiar with basic noncooperative game theory.…

Kartoniert / Broschiert. Condition: New. A Silverman game is a two-person zero-sum game defined in terms of two sets S I and S II of positive numbers, and two parameters, the threshold T > 1 and the penalty v > 0. Players I and II independently choose numbers from S I and S II, respectively. The h.

PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Condition: New. Print on Demand pp. v + 140 26 Figures.

Condition: New. PRINT ON DEMAND pp. v + 140.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Games are studied in which within certain bounds the player with the larger number wins, but loses if it is too much larger than the other. The games model various bidding or spending situations governed by rules of this nature. Under quite general conditions the games reduce to finite matrix games.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 152 pp. Englisch.…

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A Silverman game is a two-person zero-sum game defined in terms of two sets S I and S II of positive numbers, and two parameters, the threshold T 1 and the penalty v 0. Players I and II independently choose numbers from S I and S II, respectively. The higher number wins 1, unless it is at least T times as large as the other, in which case it loses v. Equal numbers tie. Such a game might be used to model various bidding or spending situations in which within some bounds the higher bidder or bigger spender wins, but loses if it is overdone. Such situations may include spending on armaments, advertising spending or sealed bids in an auction. Previous work has dealt mainly with special cases. In this work recent progress for arbitrary discrete sets S I and S II is presented. Under quite general conditions, these games reduce to finite matrix games. A large class of games are completely determined by the diagonal of the matrix, and it is shown how the great majority of these appear to have unique optimal strategies. The work is accessible to all who are familiar with basic noncooperative game theory. 152 pp. Englisch.…