Movatterモバイル変換

[0]ホーム
URL:

×

zbMATH Open — the first resource for mathematics

from until
Reset all

Examples

GeometrySearch for the termGeometry inany field. Queries arecase-independent.
Funct*Wildcard queries are specified by* (e .g.functions,functorial, etc.). Otherwise the search isexact.''Topological group'':Phrases (multi - words) should be set in''straight quotation marks''.
au: Bourbaki & ti: AlgebraSearch forauthorBourbaki andtitleAlgebra. Theand-operator & is default and can be omitted.
Chebyshev | TschebyscheffTheor-operator| allows to search forChebyshev orTschebyscheff.
Quasi* map* py: 1989The resulting documents havepublicationyear1989.
so:Eur* J* Mat* Soc* cc:14Search for publications in a particularsource with aMathematics SubjectClassificationcode in14.
cc:*35 ! any:ellipticSearch for documents about PDEs (prefix with * to search only primary MSC); the not-operator ! eliminates all results containing the wordelliptic.
dt: b & au: HilbertThedocumenttype is set tobooks; alternatively:j forjournal articles,a forbookarticles.
py: 2000 - 2015 cc:(94A | 11T)Numberranges when searching forpublicationyear are accepted . Terms can be grouped within( parentheses).
la: chineseFind documents in a givenlanguage .ISO 639 - 1 (opens in new tab) language codes can also be used.
st: c r sFind documents that arecited, havereferences and are from asingle author.

Fields

ab Text from the summary or review (for phrases use “. ..”)
an zbMATH ID, i.e.: preliminary ID, Zbl number, JFM number, ERAM number
any Includes ab, au, cc, en, rv, so, ti, ut
arxiv arXiv preprint number
au Name(s) of the contributor(s)
br Name of a person with biographic references (to find documents about the life or work)
cc Code from the Mathematics Subject Classification (prefix with* to search only primary MSC)
ci zbMATH ID of a document cited in summary or review
db Database: documents in Zentralblatt für Mathematik/zbMATH Open (db:Zbl), Jahrbuch über die Fortschritte der Mathematik (db:JFM), Crelle's Journal (db:eram), arXiv (db:arxiv)
dt Type of the document: journal article (dt:j), collection article (dt:a), book (dt:b)
doi Digital Object Identifier (DOI)
ed Name of the editor of a book or special issue
en External document ID: DOI, arXiv ID, ISBN, and others
in zbMATH ID of the corresponding issue
la Language (use name, e.g.,la:French, orISO 639-1, e.g.,la:FR)
li External link (URL)
na Number of authors of the document in question. Interval search with “-”
pt Reviewing state: Reviewed (pt:r), Title Only (pt:t), Pending (pt:p), Scanned Review (pt:s)
pu Name of the publisher
py Year of publication. Interval search with “-”
rft Text from the references of a document (for phrases use “...”)
rn Reviewer ID
rv Name or ID of the reviewer
se Serial ID
si swMATH ID of software referred to in a document
so Bibliographical source, e.g., serial title, volume/issue number, page range, year of publication, ISBN, etc.
st State: is cited (st:c), has references (st:r), has single author (st:s)
sw Name of software referred to in a document
ti Title of the document
ut Keywords

Operators

a & bLogical and (default)
a | bLogical or
!abLogical not
abc*Right wildcard
ab cPhrase
(ab c)Term grouping

See also ourGeneral Help.

Minimum cost spanning tree games.(English)Zbl 0461.90099


MSC:

91A40 Other game-theoretic models
91A12 Cooperative games
91B32 Resource and cost allocation (including fair division, apportionment, etc.)
91A80 Applications of game theory

Cite

References:

[1]C.G. Bird, ”On cost allocation for a spanning tree: A game theory approach”,Networks 6 (1976) 335–350. ·Zbl 0357.90083 ·doi:10.1002/net.3230060404
[2]A. Claus and D.J. Kleitman, ”Cost-allocation for a spanning tree”,Networks 3 (1973) 289–304. ·Zbl 0338.90031 ·doi:10.1002/net.3230030402
[3]A. Claus and D. Granot, ”Game theory application to cost allocation for a spanning tree”, Working Paper No. 402, Faculty of Commerce and Business Administration, University of British Columbia (June 1976).
[4]D. Granot and G. Huberman, ”Minimum cost spanning tree games”, Working Paper No. 403, Faculty of Commerce, U.B.C. (June 1976; revised Sept. 1976/August 1977).
[5]D. Granot and G. Huberman, ”Permutationally convex games and minimum spanning tree games”, Discussion Paper 77-10-3, Simon Fraser University (June 1977).
[6]A. Kopelowitz, ”Computation of the kernels of simple games and the nucleolus ofn-person games”, Research Memorandum No. 31, Department of Mathematics, The Hebrew University of Jerusalem (September 1967).
[7]S.C. Littlechild, ”A simple expression for the nucleolus in a special case”,International Journal of Game Theory 3 (1974) 21–29. ·Zbl 0281.90108 ·doi:10.1007/BF01766216
[8]N. Megiddo, ”Computational complexity and the game theory approach to cost allocation for a tree”,Mathematics of Operations Research 3 (1978) 189–196. ·Zbl 0397.90111 ·doi:10.1287/moor.3.3.189
[9]N. Megiddo, ”Cost allocation for Steiner trees”,Networks 8 (1978) 1–6. ·Zbl 0378.90118 ·doi:10.1002/net.3230080104
[10]L.S. Shapley, ”A value forn-person games”,Annals of Mathematics Study 28 (1953) 307–317. ·Zbl 0050.14404
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
© 2025FIZ Karlsruhe GmbHPrivacy PolicyLegal NoticesTerms & Conditions
  • Mastodon logo
 (opens in new tab)
[8]ページ先頭
©2009-2025 Movatter.jp