LEADER 01119nam a2200289 i 4500 001 991000933849707536 005 20020507104041.0 008 970308s1978 sz ||| | eng 035 $ab10150109-39ule_inst 035 $aLE00639348$9ExL 040 $aDip.to Fisica$bita 084 $a52.9.58 084 $a52.9(082.2) 111 2 $aESO Conference [on] optical telescopes of the future$0461928 245 10$aESO Conference [on] optical telescopes of the future :$bGeneva, 12-15 December 1977 :$bproceedings /$cedited by F. Pacini, W. Richter and R.N. Wilson 260 $aGeneva :$b[s.n.],$c1978 300 $a553 p. :$bill. ;$c30 cm. 650 4$aOptical instruments$xCongresses 700 1 $aPacini, F. 700 1 $aRichter, W. 700 1 $aWilson, Richard 907 $a.b10150109$b21-09-06$c27-06-02 912 $a991000933849707536 945 $aLE006 52.9.57+52.9.58 PAC$g1$i2006000029438$lle006$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i10179689$z27-06-02 996 $aESO Conference optical telescopes of the future$9187600 997 $aUNISALENTO 998 $ale006$b01-01-97$cm$da $e-$feng$gsz $h0$i1 LEADER 05505nam 22007575 450 001 9910886077403321 005 20251225201955.0 010 $a3-031-71033-9 024 7 $a10.1007/978-3-031-71033-9 035 $a(MiAaPQ)EBC31641989 035 $a(Au-PeEL)EBL31641989 035 $a(CKB)34774631800041 035 $a(DE-He213)978-3-031-71033-9 035 $a(OCoLC)1455138496 035 $a(EXLCZ)9934774631800041 100 $a20240903d2024 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithmic Game Theory $e17th International Symposium, SAGT 2024, Amsterdam, The Netherlands, September 3?6, 2024, Proceedings /$fedited by Guido Schäfer, Carmine Ventre 205 $a1st ed. 2024. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024. 215 $a1 online resource (549 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v15156 311 08$a3-031-71032-0 327 $a -- The Computational Complexity of the Housing Market. -- Ex-post Stability under Two-Sided Matching: Complexity and Characterization. -- Approval-Based Committee Voting under Uncertainty. -- Matching. -- Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem. -- Online Matching with High Probability. -- The Team Order Problem: Maximizing the Probability of Matching Being Large Enough. -- Fair Division and Resource Allocation. -- Fair Division of Chores with Budget Constraints. -- Fair Division with Interdependent Values. -- Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations. -- Incentives in Dominant Resource Fair Allocation under Dynamic Demands. -- Mechanism Design. -- Agent-Constrained Truthful Facility Location Games. -- The k-Facility Location Problem Via Optimal Transport: A Bayesian Study of the Percentile Mechanisms. -- Discrete Single-Parameter Optimal Auction Design. -- Estimating the Expected Social Welfare and Cost of Random Serial Dictatorship. -- Game Theory and Repeated Games. -- Swim Till You Sink: Computing the Limit of a Game. -- The Investment Management Game: Extending the Scope of the Notion of Core. -- Edge-Dominance Games on Graphs. -- Playing Repeated Games with Sublinear Randomness. -- Pricing, Revenue, and Regulation. -- Mind the Revenue Gap: On the Performance of Approximation Mechanisms under Budget Constraints. -- Sublogarithmic Approximation for Tollbooth Pricing on a Cactus. -- To Regulate or Not to Regulate: Using Revenue Maximization Tools to Maximize Consumer Utility. -- Balancing Participation and Decentralization in Proof-of-Stake Cryptocurrencies. -- Matroid Theory in Game Theory. -- Price of Anarchy in Paving Matroid Congestion Games. -- Price of Anarchy for Graphic Matroid Congestion Games. -- Non-Adaptive Matroid Prophet Inequalities. -- Matroid Bayesian Online Selection. -- Information Sharing and Decision Making. -- Prediction-Sharing During Training and Inference. -- Calibrated Recommendations for Users with Decaying Attention. -- Matrix Rationalization via Partial Orders. -- Computational Complexity and Resource Allocation. -- k-Times Bin-Packing and its Application to Fair Electricity Distribution. -- Condorcet Markets. -- Complexity of Round-Robin Allocation with Potentially Noisy Queries. 330 $aThis volume constitutes the refereed proceedings of 17th International Symposium on Algorithmic Game Theory, SAGT 2024, held in Amsterdam, The Netherlands, during September 3?6, 2024. The 29 full papers included in this book were carefully reviewed and selected from 84 submissions. They were organized in topical sections as follows: matching; fair division and resource allocation; mechanism design; game theory and repeated games; pricing, revenue, and regulation; matroid theory in game theory; information sharing and decision making; computational complexity and resource allocation. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v15156 606 $aComputer simulation 606 $aData structures (Computer science) 606 $aInformation theory 606 $aApplication software 606 $aArtificial intelligence 606 $aAlgorithms 606 $aComputer networks 606 $aComputer Modelling 606 $aData Structures and Information Theory 606 $aComputer and Information Systems Applications 606 $aArtificial Intelligence 606 $aDesign and Analysis of Algorithms 606 $aComputer Communication Networks 615 0$aComputer simulation. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aApplication software. 615 0$aArtificial intelligence. 615 0$aAlgorithms. 615 0$aComputer networks. 615 14$aComputer Modelling. 615 24$aData Structures and Information Theory. 615 24$aComputer and Information Systems Applications. 615 24$aArtificial Intelligence. 615 24$aDesign and Analysis of Algorithms. 615 24$aComputer Communication Networks. 676 $a003.3 700 $aScha?fer$b Guido$01769155 701 $aVentre$b Carmine$01769156 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910886077403321 996 $aAlgorithmic Game Theory$94236911 997 $aUNINA